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?