StableTopologicalSort: don't eagerly sort queue

Signed-off-by: Jon Johnson <[email protected]>
dominikbraun · Jun 5, 2023 · 1f49f8f · 1f49f8f
1 parent c0f5621
commit 1f49f8f
Showing 1 changed file with 4 additions and 4 deletions.
diff --git a/dag.go b/dag.go
@@ -114,12 +114,12 @@ func StableTopologicalSort[K comparable, T any](g Graph[K, T], less func(K, K) b
 
 			if len(predecessors) == 0 {
 				queue = append(queue, vertex)
-
-				sort.Slice(queue, func(i, j int) bool {
-					return less(queue[i], queue[j])
-				})
 			}
 		}
+
+		sort.Slice(queue, func(i, j int) bool {
+			return less(queue[i], queue[j])
+		})
 	}
 
 	gOrder, err := g.Order()