forked from cotes2020/jekyll-theme-chirpy
-
Notifications
You must be signed in to change notification settings - Fork 0
Data Structures and Algorithms
Santhosh Kumar Devadoss edited this page Oct 19, 2023
·
4 revisions
Directed Acyclic Graphs:
- Not every graph can have a topological ordering. A graph which contains a cycle cannot have a valid ordering.
- The only type of graph which as a valid topological ordering is a Directed Acyclic Graph (DAG). These are graphs with directed edges and no cycles.
- By definition, all rooted trees have a topological ordering since they do not contain any cycles.