Concepts4
⚙️AlgorithmAdvanced
Hungarian Algorithm
The Hungarian algorithm solves the square assignment problem (matching n workers to n jobs) in O(n^{3}) time using a clever potential (label) function on vertices.
#hungarian algorithm#assignment problem#bipartite matching+11
⚙️AlgorithmIntermediate
Minimum Spanning Tree - Prim
Prim's algorithm builds a Minimum Spanning Tree (MST) by growing a tree from an arbitrary start vertex, always adding the lightest edge that connects the tree to a new vertex.
#prim#minimum spanning tree#mst+12
⚙️AlgorithmIntermediate
Floyd-Warshall Algorithm
Floyd–Warshall computes the shortest distances between all pairs of vertices in O(n^3) time using dynamic programming.
#floyd-warshall#all pairs shortest path#apsp+12
⚙️AlgorithmIntermediate
Dijkstra's Algorithm
Dijkstra's algorithm finds shortest path distances from one source to all vertices when all edge weights are non-negative.
#dijkstra#shortest path#greedy+11