Jump to content

  • Log In with Google      Sign In   
  • Create Account

FREE SOFTWARE GIVEAWAY

We have 4 x Pro Licences (valued at $59 each) for 2d modular animation software Spriter to give away in this Thursday's GDNet Direct email newsletter.


Read more in this forum topic or make sure you're signed up (from the right-hand sidebar on the homepage) and read Thursday's newsletter to get in the running!


stoneyrich

Member Since 09 Aug 2012
Offline Last Active Aug 02 2014 01:38 PM

#5001231 Path node , route path, list algorithm

Posted by stoneyrich on 15 November 2012 - 09:00 AM

Okay Guys thanks very much i noticed i had over 100 views yet no one came to my rescue.

Well i was able to figure it out. in case anyone chanced upon this search and finds a simlar situation this is how
i went about it. Using Graphs Representation and BFS & DFS for path or route finding
  • i represented each conn.# or connector.# as a vertices or a node
  • created an undirected edge as a link or a connection to another conn.# object
  • created a graph out of the table
  • Used BFS,DFS to find the paths or route.
for now that is the approach i have used and seems to work well :)


PARTNERS