The Astar algorithm requires a hysteresis to be calculated. The Manhatten method, for instance, is calculated as follows:
H = 10*(abs(currentX-targetX) + abs(currentY-targetY))
Now what happens if the graph I'm running the search on is arbitrary? I.e. the nodes aren't located in a spacial dimension, and nodes can have any amount of linked nodes ranging from 0 to 100? I don't really have any way of knowing what "currentX" or "currentY" even is. The only information I have are the links between nodes; each node holds a list of the nodes it is linked with.
Am I stuck with Dijkstra’s algorithm?