Summary of Combinatorial Optimizations Trees Properties & Proofs MST: Kruskal Prim Shortest Path Bellmann-Ford Floyd-Warshall Dijkstra Johnson's Algorithm flow network ford-fulkerson Max-Flow/Min-Cut via Ford-Fulkerson example 1 example 2 Matchings: Max-Matching/Min-Covering in: Bipartite Graph