vonstauffen
Programmer
Hi,
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!
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!