5
$\begingroup$

It is possible to find the shortest route thanks to algorithms like A*, bread first search, depth first search, etc..

Is there any known algorithm to find how many routes are available if there are more than 1 optimum solution (for example routes with same costs) or any solution at all.

I am working on some graph algorithms but I don't think I'm on the right direction. Any advices?

  • 0
    Check Dijkstra's algorithm, there's a modification to the standard algo that can give you all optimal paths. Also see http://stackoverflow.com/questions/2421605/finding-all-shortest-paths-from-every-pair-of-nodes-on-a-graph2010-12-13
  • 0
    how about finding the amount of routes with a certain length?2010-12-13
  • 1
    Bread first search certainly works, but possibly there are butter alternatives...2011-05-08
  • 0
    I don't see how Depth First Search helps in finding shorting routes.2011-08-07

2 Answers 2