The modification of Dijkstra Algorithm related to maximum weighted path in a weighted undirected graph is given here. Finding path with maximum minimum capacity in graph Can anyone give a clear and easy explanation of this algorithm by some example?
Asked
Active
Viewed 893 times
0
-
What is it specifically you don't understand from reading the link you posted or other articles you've found when googling? – Hannes Johansson Jul 15 '15 at 16:28
-
The implementation of this pseudo code. I tried to apply to examples but couldn't reach the maximum weighted path. – Mathematics Jul 15 '15 at 16:43
-
My problem is to find maximum distance between any two nodes in a weighted undirected graph. – Mathematics Jul 15 '15 at 16:46