Graph Algorithms
Algorithm on Graphs
- elementary graph algorithms
- breadth-first search
- depth-first search
- minimum spanning tree
- shortest path problem
- single-source shortest path
- all-pairs shortest path
- maximum flow
- max-flow vs min-cut
- applications
DFS
time complexity: O(|V|+|E|)