11463 - Commandos

Difficulty : medium

Solution Description :

Category : BFS, DFS, Dijkstra, Floyd Warshall 

Don't Need to think more....

At first Find the minimum distance from start node to all nodes and store at dist1[0...n-1].
And find the minimum distance from destination node to all nodes and store at dist2[0...n-1]

Then find the maximum distance of dist[0...n-1]
where dist[i] = dist1[i] + dist2[i].

Finally print the maximum distance...