# Common Graph Theory Problems and Algorithms #### Shortest path  Algorithms: * BFS (unweighted graph), Dijkstra's, Bellman-Ford, Floyd-Warshall, A*, and many more #### Connectivity  Algorithms: * Use union find data structure or any search algorithm (e.g. DFS) #### Negative Cycles  Algorithms: * Bellman-Ford and Floyd-Warshall #### Strongly Connected Components  Algorithms: * Tarjan's and Kosaraju's algorithm #### Traveling Salesman Problem  Algorithms: * Held-Karp, branch and bound and many approximation algorithms #### Bridges  #### Articulation Points  #### Minimum Spanning Tree (MST)   Algorithms: * Kruskal's * Prim's and Boruvka's algorithm #### Network Flow: Max Flow  Algorithms: * Ford-fulkerson * Edmonds-Karp & Dinic's algorithm