Go Premium for a chance to win a PS4. Enter to Win

x
?
Solved

directed graph traversal

Posted on 2014-12-16
7
Medium Priority
?
86 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
  • 3
  • 2
6 Comments
 
LVL 85

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 85

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 85

Accepted Solution

by:
ozo earned 2000 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

VIDEO: THE CONCERTO CLOUD FOR HEALTHCARE

Modern healthcare requires a modern cloud. View this brief video to understand how the Concerto Cloud for Healthcare can help your organization.

Question has a verified solution.

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

Computer science students often experience many of the same frustrations when going through their engineering courses. This article presents seven tips I found useful when completing a bachelors and masters degree in computing which I believe may he…
If you are a mobile app developer and especially develop hybrid mobile apps then these 4 mistakes you must avoid for hybrid app development to be the more genuine app developer.
With the power of JIRA, there's an unlimited number of ways you can customize it, use it and benefit from it. With that in mind, there's bound to be things that I wasn't able to cover in this course. With this summary we'll look at some places to go…
Six Sigma Control Plans

772 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