Graph Algorithms Graphs’ definitions and representations Graph Traversals Topological Sort & Cycle Detection Connected Components Minimum Spanning Tree Kruskal Prim Single Source Shortest Path Unweighted graphs/digraphs (BFS) Bellman-Ford Dijkstra All Pairs Shortest Paths Generalization of Bellman-Ford Floyd-Warshall Johnson’s algorithm Classic Paths and Cycles Shortest Simple Cycle (girth) Eulerian Path/Cycle Hamiltonian Path/Cycle Flow Network Ford-Fulkerson / Edmonds-Karp