Hi ...I'm writing a program to find an acyclic_path in a graph (the graph should be define by a person who runs the program...)
I know that the algorithm is in internet but I don't know how can I define a graph in prolog like this :
g([Vertex, ...],[e(Vertex1,Vertex3), ...])
I've found some links but at last I didn't understand what to do....
I'm a begginer in prolog and it's so hard to think in another way of programmin...plz help me!