Hi

I'm looking for a "shortest path algorithm" in a graph, but with a maximum number of edges limit . So the path has to contain at most N edges .

10x

Happy Holiday

If your search of the literature and the web doesn't yield an exact match for your assignment, then you might consider the following:


1. Implement (or find an implementation for) your favorite shortest-path algorithm. Look in class notes or text or other reference material. Maybe try something like NIST shortest path for starters.

2. Make sure your implementation works for connected and unconnected graphs. In other words if there is no path to the target, make sure there isn't some kind of infinite loop or infinite recursion looking for a non-existent path.

3. In the path-finding part of the code, change the function(s) to take a parameter that designates the maximum acceptable path length. If the next part of the current path would be longer than the maximum, return whatever value is appropriate for an unconnected graph (in other words short-circuit the search at that point to make it appear as though there is no path to the target).

Regards,

Dave