We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 91c304d commit ff1442aCopy full SHA for ff1442a
Source/Graph/Graph.cs
@@ -72,9 +72,6 @@ public class DomRelation<Node>
72
[NotDelayed]
73
internal DomRelation(Graph<Node> g, Node source)
74
{
75
- // TODO should we enable saying that the graph is a DAG, to enable an O(N) dominance algorithm?
76
- // Or is the algorithm already O(N) for DAG graphs?
77
-
78
graph = g;
79
// slot 0 not used: nodes are numbered from 1 to n so zero
80
// can represent undefined.
0 commit comments