Tech
Forums
Jobs
Books
Events
Live
Interviews
More
Learn
Training
Career
Members
Videos
News
Blogs
Login
Sign Up
Ask Question
1
Reply
Shortest Number Of Hops Algorithm
Chris
Jun 2 2009 12:44 PM
3.2k
Reply
I'm trying to calculate the shortest number of hops given the following:
All hops are the same value/distance.
Heirarchy
Regions are collections of Sections
Sections are collection of Nodes
Nodes connect to one or more Nodes
My table looks like this: fromRegionID, fromSectionID, fromNodeID, toNodeID, toSectionID, toRegionID
Any suggestion on how should I go about calculating a route?
Upload Source Code
Select only zip and rar file.
Post
Reset
Cancel
Answers (
1
)
Next Recommended Forum
Programming Exercises
what is the algorith in creating exam schedule system?...