Find the maximum weight edge in a graph G?

by D.dream   Last Updated October 11, 2019 19:26 PM - source

My assignment is like, given V villages that connected with E roads in graph G, every road is labeled with a positive number. And you have to at least at the level of this number to access this road. In other word, if a road labeled 5, then your level has to be at least 5 or more to access this road. Now my assignment ask to design annalgorith, find the minimum level of clearance needed to be able to reach any of the villages in V from any other. So, my interpretation is we can just find the maximum weight edge in a graph. But I haven’t figure out what algorithm is appropriate for this condition.

Tags : algorithm graph

Related Questions

MST in unDirected graph

Updated December 02, 2017 18:26 PM

Graph Theory : Will it stop or not?

Updated March 22, 2017 11:26 AM