Originally posted by Divya Gehlot:
Hi,
I need to work on crtical path anlysis for project management.Can any one suggest me how the algorithm work in java 5.
Hello RanchHand
Pl find out if the shotestpath finding method, by making use of matrices
under the Dijikstra's Algorithm can be made in java from the C++ program(given below)
and if so the summary of the algorithm goes like this.In real life we are required to find the shotest path between two cities.For an airliner would be interested in finding the most economical route between any two cities in a given network of cities.This algorithm to find such a path was first propsed by E.W.Dijikstra
the program for sames in c++ is
BestWishes