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.

- Serverfault Help
- Superuser Help
- Ubuntu Help
- Webapps Help
- Webmasters Help
- Programmers Help
- Dba Help
- Drupal Help
- Wordpress Help
- Magento Help
- Joomla Help
- Android Help
- Apple Help
- Game Help
- Gaming Help
- Blender Help
- Ux Help
- Cooking Help
- Photo Help
- Stats Help
- Math Help
- Diy Help
- Gis Help
- Tex Help
- Meta Help
- Electronics Help
- Stackoverflow Help
- Bitcoin Help
- Ethereum Help