
Hi,
Given a source vertex and a destination vertex, there could exist multiple paths which can be traversed unambiguously between them. Which algorithm would provide us these multiple paths?
Thanks


Coordinator
May 8, 2007 at 8:21 AM

Could you define unambiguously? Are you looking for a particular criteria such as a shortest path?



Consider a multi branched graph. There could be a scenario where from the start vertex to target vertex we have 23 shortest paths (i.e paths with equal number of vertices b\w start n target).
Which algorithm gives us the list of such paths?
If one provides more vertices in a shortest path, there would be no ambiguity.


Coordinator
May 9, 2007 at 6:30 AM

I don't think QuickGraph has any algorithm for that particular problem.



I would be interested in the same.
I have a workflow where decisions lead the graph to two or more different paths after the decision node. I not only need to find out if there are indeed branches after a decision node, but also if these branches are joined later on again.
Does anybody have an idea on how to tackle this?


Coordinator
Jan 5, 2009 at 8:52 PM

QuickGraph now provides a way to compute the kshortest path between 2 nodes.



Could someone please provide a simple sample of performing this? I have the latest download, but cannot find that kShortest path implementation.
thanks



Its in QuickGraph.Algorithms.RankedShortestPath.HoffmanPavleyRankedShortestPathAlgorithm<TVertex, TEdge>

