##
Longest path between any pair of vertices
October 17, 2016

We are given a map of cities connected with each other via cable lines such that there is no cycle between any two cities. We need to find the maximum length of cable between any two cities for given city map. Input : n = 6 1 2 3 // Cable length from 1 to… Read More »