Solved

directed graph traversal

Posted on 2014-12-16
7
79 Views
Last Modified: 2015-01-29
i have the following graph that i am trying to create a sequence out of for the nodes. it's very similar to a DFS traversal excepted nodes may be visited multiple times.  i am trying to find the best algorithm to create the sequence, the final result is listed below (see attached).  note that E should have been 4th but because of the false route, its sequence got updated to 6th (the higher sequence number).

i want to traverse the TRUE route first and then the nearest FALSE route (if there are children conditionals).  

my initial take on the algorithm is this:
1) keep getting sequence until i hit a conditional or end node
2) if hit end node, stop
3) if hit conditional, take the TRUE route
4) once the TRUE route is done, traverse the nearest false route
workflow.jpg
0
Comment
Question by:mmingfeilam
[X]
Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
  • 3
  • 2
7 Comments
 
LVL 84

Expert Comment

by:ozo
ID: 40503062
What is the relationship between the desired sequence and the directed graph?
Is the goal to visit all the nodes?
0
 

Author Comment

by:mmingfeilam
ID: 40503246
The directed graph is used to show parent/child relationship.  So we go from parent to child in the direction of the arrow. I want to go thru all the nodes, some multiple times, to generate a sequence in case I want to save to DB.
0
 
LVL 84

Expert Comment

by:ozo
ID: 40503322
Are there some nodes that you are required to go through multiple times?
Are there requirements on the order other than those imposed by the arrows in the graph?
0
What does it mean to be "Always On"?

Is your cloud always on? With an Always On cloud you won't have to worry about downtime for maintenance or software application code updates, ensuring that your bottom line isn't affected.

 

Author Comment

by:mmingfeilam
ID: 40503380
yes, if the arrow brings you back to a node already visited, then you have to reset that node's sequence number to the newer, higher number.  other than that, the arrow determines the order.
0
 
LVL 84

Accepted Solution

by:
ozo earned 500 total points
ID: 40503402
So is the only requirement to follow the arrows and visit all nodes?
Breadth-first instead of Depth-first may be better at finding the shortest such path, but is that something you care about?
0
 
LVL 101

Expert Comment

by:mlmcc
ID: 40577915
I've requested that this question be deleted for the following reason:

Not enough information to confirm an answer.
0

Featured Post

Optimize your web performance

What's in the eBook?
- Full list of reasons for poor performance
- Ultimate measures to speed things up
- Primary web monitoring types
- KPIs you should be monitoring in order to increase your ROI

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Today, the web development industry is booming, and many people consider it to be their vocation. The question you may be asking yourself is – how do I become a web developer?
Part One of the two-part Q&A series with MalwareTech.
Starting up a Project
I've attached the XLSM Excel spreadsheet I used in the video and also text files containing the macros used below. https://filedb.experts-exchange.com/incoming/2017/03_w12/1151775/Permutations.txt https://filedb.experts-exchange.com/incoming/201…

617 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question