This page has been robot translated, sorry for typos if any. Original content here.

Management of special projects (compendium of lecture NUPSU)

Ordering graph

It is permissible that when folding the project, 12 steps were seen: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 and 24 robots, which should be repeated: (0, 1), (0 , 2), (0, 3), (1, 2), (1, 4), (1, 5), (2, 3), (2, 5), (2, 7), (3, 6 ), (3, 7), (3, 10), (4, 8), (5, 8), (5, 7), (6, 10), (7, 6), (7, 8), (7, 9), (7, 10), (8, 9), (9, 11), (10, 9), (10, 11). They laid down the cradle graph 1.

Ordering the current graph of the pitch in such a rooted and robotic one, while for a robotic robot the front third rooted is the left and the smallest number for the final robot. In other words, in the streamlined graph of all robots-roztashovany evil on the right: go with lower numbers to go with great numbers.

The rose is the largest graph for the vertical balls (dashed by dotted lines and the first Roman numerals).

Having helped in the first ball, I’m reading 0, the Duma is okay for the graph, for the first and for the first time. Todd without entering the page, get lost 1, then I will assert the second ball. Having won the Duma’s Prize 1 and more, they’re robust, it’s possible to get the ball 4 and 2 without any input, and I’ll approve the 3rd ball. Selling a process, obsessed with a graph 2.

Disorders sіtoviy graphіk

Fig.5.3. Disorders sіtoviy graphіk

Ordering graph

Figure 5.4. Ordering graph

Now, bachimo, the first numbering is not right: so, go to the 6th ball at the 6th ball and the lower number, let’s lower the 7th from the front ball. Those same tales about tales 9 і 10.

Arrangements sіtoviy graphіk

Fig. 5.5. Arrangements sіtoviy graphіk

It’s possible to number the number of times before the release of the graph and obsessed with the ordering of the graph (Fig. 5.5.). Varto mark, scho numbering, roztashovany in one vertical sphere, the principle value is not the same, so scho numbering of the same graph can be ambiguous.