(detect_loop): Update incomplete comment.

From Mark Kettenis.

diff --git a/src/tsort.c b/src/tsort.c
index 2097eca95074103fdac2f2a2ae44b8e356e1b6d0..dca29189bb904a5cca041d431d651b3e82a1454a 100644 (file)
--- a/src/tsort.c
+++ b/src/tsort.c
@@ -329,8 +329,12 @@ scan_zeros (struct item *k)
    this, but that is no problem.  If we encounter an item that we have
    encountered before, we know that we've found a cycle.  All we have
    to do now is retrace our steps, printing out the items until we
-   encounter that item again.  (This does not have to be the item that
-   we started at in the first place.)  Since the order */
+   encounter that item again.  (This is not necessarily the item that
+   we started from originally.)  Since the order in which the items
+   are stored in the tree is not related to the specified partial
+   ordering, we may need to walk the tree several times before the
+   loop has completely been constructed.  If the loop was found, the
+   global variable LOOP will be NULL.  */
 
 static int
 detect_loop (struct item *k)