'Minimum single edge weight to navigate through all nodes of a graph

Given an undirected graph with weighted edges you are asked to find the minimum single edge weight to connect all nodes.

enter image description here

Given this graph the answer would be 3, as you can travel through all edges without using an edge with more than 3 weight. What is an efficient way to solve this?

graphspanning-tree


Sources

This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.

Source: Stack Overflow

Solution Source

Related Questions