Shortest Number Of Hops Algorithm

Question

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?