Contact US

Log In

Come Join Us!

Are you a
Computer / IT professional?
Join Tek-Tips Forums!
  • Talk With Other Members
  • Be Notified Of Responses
    To Your Posts
  • Keyword Search
  • One-Click Access To Your
    Favorite Forums
  • Automated Signatures
    On Your Posts
  • Best Of All, It's Free!

*Tek-Tips's functionality depends on members receiving e-mail. By joining you are opting in to receive e-mail.

Posting Guidelines

Promoting, selling, recruiting, coursework and thesis posting is forbidden.

Students Click Here

Need all paths of a node

Need all paths of a node

Need all paths of a node


i've uploaded a model which is in fact a directed graph. As you are professionals and I'm a newbie to prolog maybe you can help me with my problem. I've spend so much time with this issue and I think it is not a problem for you guys to do it in PROLOG.

In my model I have 10 nodes, 25 arcs and a few connectors. These are XOR (a 'x' in that quad), OR (a 'circle' in the quad) and AND (a '+' in the quad).

Can one code all possible paths, e.g. from node 1 to node 10 respecting the circles in that directed graph in PROLOG? Is this realisable? How would be the code?

Thank you very much in advance for your answer!

Red Flag This Post

Please let us know here why this post is inappropriate. Reasons such as off-topic, duplicates, flames, illegal, vulgar, or students posting their homework.

Red Flag Submitted

Thank you for helping keep Tek-Tips Forums free from inappropriate posts.
The Tek-Tips staff will check this out and take appropriate action.

Reply To This Thread

Posting in the Tek-Tips forums is a member-only feature.

Click Here to join Tek-Tips and talk with other members! Already a Member? Login

Close Box

Join Tek-Tips® Today!

Join your peers on the Internet's largest technical computer professional community.
It's easy to join and it's free.

Here's Why Members Love Tek-Tips Forums:

Register now while it's still free!

Already a member? Close this window and log in.

Join Us             Close