Loading

Shortest Number Of Hops Algorithm

Chris

I'm trying to calculate the shortest number of hops given the following:

My table looks like this: fromRegionID, fromSectionID, fromNodeID, toNodeID, toSectionID, toRegionID

Any suggestion on how should I go about calculating a route?

1 Reply

Know the answer? Post it — somebody with the same question will find it here.

Zoran Horvat16y ago
How many rows do you have in your table?
How many distinct (regionId, sectionId, nodeId) values do you have?