0

Hi

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

i've found shortest path algorithms but not with a number of edges limit , and i've tried to modify A* , Bellman-Ford algorithms but without success .

i need an algorithm that has the limit embedded .

10x

Happy Holiday