Talk:Dependency graph
From Wikipedia, the free encyclopedia
[edit] Conflicting statements
- In mathematics and computer science, a dependency graph is a directed acyclic graph [...]
- In a dependency graph, impossible calculations form cycles.
A DAG is cycle-free, by definition. How can these two statements be modified to reflect the true aspects of dependency graphs? --Abdull (talk) 16:03, 30 May 2008 (UTC)
- Ah, I just left the first part from the stub. I think one should just remove the acyclic in the first statement, because no one builds some digraph and then checks if it's acyclic and then calls it dependency graph. Everyone just builds some dependency graph and searches for cycles in order to see if the dependency graph can be evaluated. --Tetha (talk) 05:35, 3 June 2008 (UTC)
