Tek-Tips is the largest IT community on the Internet today!
Members share and learn making Tek-Tips Forums the best source of peer-reviewed technical information on the Internet!
-
Congratulations strongm on being selected by the Tek-Tips community for having the most helpful posts in the forums last week. Way to Go!
Graphs: Shortest Path Probs
- Thread starter Nuge
- Start date
For shortest path you can use either a modified Roy-Floyd algorithm (pretty elaborate solution) either the classical backtracking approach; with good stopping conditions you may get an answer in reasonable time.
For minimum spanning tree you can try using Kruskal algorithm.
Make a Google search for the names, it might help if you want all kinds of details. It's been a while since I last used Kruskal, but it is a good and fast enough algorithm, especially if you have already the Adj. Mat. [red]Nosferatu[/red]
We are what we eat...
There's no such thing as free meal...
once stated: methane@personal.ro
For minimum spanning tree you can try using Kruskal algorithm.
Make a Google search for the names, it might help if you want all kinds of details. It's been a while since I last used Kruskal, but it is a good and fast enough algorithm, especially if you have already the Adj. Mat. [red]Nosferatu[/red]
We are what we eat...
There's no such thing as free meal...
once stated: methane@personal.ro
- Status