Tackling complex graph problems like topological sorting and finding shortest paths with Dijkstra's, Bellman-Ford, and other algorithms.
Linearly ordering the vertices of a Directed Acyclic Graph (DAG).
Finding the shortest paths from a single source vertex to all other vertices in a graph with non-negative edge weights.
An algorithm for single-source shortest paths that can handle negative edge weights and detect negative cycles.
An all-pairs shortest path algorithm that finds the shortest distance between every pair of vertices.