Hi everbody!
so here is the problem i got:
i would like to implement some sort of map as a weighted graph. the weight is always 1. im just interested in the "jumps" from vertex to vertex.
it will be probably an Adjacency list.
but know i would like to search for a specific path between two vertices, and i want to determine wich patch is the shortest.
dijkstra i think is a bit to much because as i said i only got weights of 1.
also i would like to abort searching further if the jumps hit a certain amount.
is there a nice and easy way to do this?
thank you!
