Concepts5
⚙️AlgorithmIntermediate
Min-Cut Max-Flow Theorem
The Max-Flow Min-Cut Theorem says the maximum amount you can push from source to sink equals the minimum total capacity you must cut to disconnect them.
#max flow#min cut#edmonds karp+12
⚙️AlgorithmIntermediate
Tarjan's SCC Algorithm
Tarjan’s algorithm finds all Strongly Connected Components (SCCs) of a directed graph in a single depth-first search using a stack.
#tarjan scc#strongly connected components#low link+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
Bellman-Ford Algorithm
Bellman–Ford finds single-source shortest paths even when some edge weights are negative.
#bellman-ford#single-source shortest paths#negative weights+12
⚙️AlgorithmIntermediate
Multi-Source BFS
Multi-source BFS explores an unweighted graph starting from several sources at once to compute the minimum distance to any source for every vertex.
#multi-source bfs#graph algorithms#shortest path+11