Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| courses:cs211:winter2018:journals:patelk:chapter3 [2018/02/05 05:40] – [3.6 Directed Acyclic Graphs and Topological Ordering] patelk | courses:cs211:winter2018:journals:patelk:chapter3 [2018/02/05 05:40] (current) – [3.6 Directed Acyclic Graphs and Topological Ordering] patelk | ||
|---|---|---|---|
| Line 223: | Line 223: | ||
| * Thus, in every DAG G, there is a node with no incoming edges | * Thus, in every DAG G, there is a node with no incoming edges | ||
| * If this is not true, then there is a cycle, so it is not a DAG | * If this is not true, then there is a cycle, so it is not a DAG | ||
| - | * | + | |
| {{: | {{: | ||
