   Shortest Path
  Im not sure this is the correct place to post.However I have a group of Objects, and each object is connected from 1 to 6 other Objects.How can I calculate quickly how to get from one Object to another Object passing through the least ammount of other Objects.Hope I explained this clearly.Thanks 
  One method is  Dijkstra''s Algorithm. ;  Look up A* (pronounced A-star).Edit:This was on the front page a couple of days ago: http://gamedev.net/reference/programming/features/astar/   [edited by - yaroslavd on February 3, 2004 10:24:25 PM];  I would think a simple pathfinding style algorithm (A-star) would be fine, maybe tweaked a bit. ;  ill check those outthanks 