Comments on: Fixing dependency loops http://griffon26.kfk4ever.com/wordpress/2008/03/15/5/ A weblog about Planner, Gentoo and whatever I'm working on. Tue, 08 Apr 2008 23:16:12 +0000 http://wordpress.org/?v=2.9.2 hourly 1 By: Griffon26 http://griffon26.kfk4ever.com/wordpress/2008/03/15/5/comment-page-1/#comment-15 Griffon26 Thu, 27 Mar 2008 18:45:39 +0000 http://griffon26.kfk4ever.com/wordpress/2008/03/15/5/#comment-15 WBS numbers can only be used to see if one task is a (indirect) child of another. You will still need to check if there are any predecessor relationships that create a cycle. For a task with WBS 1.3.6.4.4 you would have to check 1.3.6.4, 1.3.6, 1.3 and 1 because you don't know in advance where the loop might be. But these are the same tasks that you will encounter when you walk forward through the graph. (They are connected through 'next' pointers.) The advantages of the graph are that we use only one method of traversal (simpler) and that you can mark nodes as visited, preventing unnecessary processing. WBS numbers can only be used to see if one task is a (indirect) child of another. You will still need to check if there are any predecessor relationships that create a cycle.

For a task with WBS 1.3.6.4.4 you would have to check 1.3.6.4, 1.3.6, 1.3 and 1 because you don’t know in advance where the loop might be. But these are the same tasks that you will encounter when you walk forward through the graph. (They are connected through ‘next’ pointers.)

The advantages of the graph are that we use only one method of traversal (simpler) and that you can mark nodes as visited, preventing unnecessary processing.

]]> By: Max http://griffon26.kfk4ever.com/wordpress/2008/03/15/5/comment-page-1/#comment-14 Max Thu, 27 Mar 2008 08:34:32 +0000 http://griffon26.kfk4ever.com/wordpress/2008/03/15/5/#comment-14 Hello, And couldn't we use the WBS number to check where we are in the tree and quickly detect loops instead of parsing the connected nodes ? Hello,

And couldn’t we use the WBS number to check where we are in the tree and quickly detect loops instead of parsing the connected nodes ?

]]>