To sort a graph topologically, the graph must be a directed acyclic graph (see DAGs).
Part of Computer Science Notes
Series on Data Structures
Graphs
Graph Theory:
Graphs/Definitions · Graphs/Matching · Graphs/Connectivity
First Theorem of Graph Theory
Graph Implementations:
Graphs/Data Structures · Graphs/ADT
Graphs/Java/Adjacency Map · Graphs/Java/Adjacency Map Lite
Graphs/Guava
Graph Algorithms:
Algorithms/Graphs
Traversal:
Graphs/Traversal · Graphs/Euler Tour · Graphs/Depth First Traversal · Graphs/Breadth First Traversal
Category:Traversal
Connectivity and Cycles:
Graphs/Finding Cycles · Graphs/Finding Connected Components · Graphs/Reachability
Transitive Closure:
Graphs/Transitive Closure · Graphs/Floyd Warshall Algorithm
Shortest Path:
Graphs/Shortest Path · Graphs/Edge Relaxation · Graphs/Dijkstra
Minimum Spanning Tree:
Graphs/Minimum Spanning Tree · Graphs/Prim Jarnik Algorithm · Graphs/Kruskal Algorithm
Graphs/Cluster Finding
Directed Acyclic Graphs:
DAGs · Graphs/Cycles · Graphs/Topological Sort
Category:Graphs · Category:Algorithms · Category:CS · Category:Data Structures
