Topological sort implemented in Python using DFS to search the graph.
Builds and returns viable schedule using DFS and topological sort.
Graph construction: O(n) [number of nodes]
DFS and Topological Sort: O(V + E) [vertices and edges]
laminarize/DFS_Topological_Sort
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|