Maximum Bandwidth: Find the Path Between Two Nodes That Maximizes Minimum Edge Capacity

Problem You have a network of n nodes and m weighted edges where edge weight represents bandwidth capacity. Find the maximum bandwidth achievable between a source node s and destination node t, defined as the maximum over all paths of the minimum edge capacity along that path. Example: Approach Modified Dijkstra or Kruskal. With Kruskal: sort edges by capacity descending, union-find until s and t are connected -- that edge's capacity is the answer. O(m log m). Follow-ups How does this differ fro…