Jump to content

  • Log In with Google      Sign In   
  • Create Account

Path node , route path, list algorithm


Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.

  • You cannot reply to this topic
4 replies to this topic

#1 stoneyrich   Members   -  Reputation: 143

Like
0Likes
Like

Posted 12 November 2012 - 09:19 AM

Hi everyone ...i would like your ideas on how to go about this list problem.

attached is a sample of the list am trying to work with:

I want to achieve a list of possible route like this

possible route 1 - 272<309<308>312>48

route 2 - 316<315>319>99

route 3 - 48<1420

< it begins from the left of the node
> it end at the right side of the node

any help ?

Attached Thumbnails

  • SnipImage.JPG


Sponsor:

#2 stoneyrich   Members   -  Reputation: 143

Like
1Likes
Like

Posted 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 :)

#3 Yrjö P.   Crossbones+   -  Reputation: 1412

Like
0Likes
Like

Posted 17 November 2012 - 10:53 AM

Can the component graph have a loop? That would be something you need to take into account.

#4 iMalc   Crossbones+   -  Reputation: 2306

Like
0Likes
Like

Posted 17 November 2012 - 05:42 PM

FYI: This happens to be the first time I've come across this thread.

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

That usually means that you haven't explained your question very well, or for some other reason it is going to require too much of our time to understand and help with.
The easier you make it for others to help you, the more help you'll get, and faster. That's just how it is.
"In order to understand recursion, you must first understand recursion."
My website dedicated to sorting algorithms

#5 stoneyrich   Members   -  Reputation: 143

Like
0Likes
Like

Posted 22 November 2012 - 02:02 AM

thanks @iMalc well i tried my best to really explain it in a way any one could understand. I think it really had to do with time
also but i was of the thought someone might have been in such a situation before.

@Stroppy Katamari
Yes, after trials i noticed some components had loops.




Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.



PARTNERS