Jump to content


Check out our Community Blogs

Alhazred

Member Since 23 Jul 2007
Offline Last Active Jan 24 2017 03:53 AM
-----

#629643 All The Paths Between 2 Points

Posted by Alhazred on 12 May 2012 - 04:37 AM

I've got a graph (not directed) with a weight assigned to each edge and which contain cycles.

At the moment I'm trying to write down an algorythm to obtain all the paths between 2 given vertexes with the total path weight.
In the paths list there must be only those without cycles.

I was thinking to Dijkstra's algorithm, but it only gives the shortest path, not all the paths.
Do you have any suggestion?
  • 1