I have the following prolog problem, I just don't know how to solve..
I hope somebody is able to help me out...
I have to build the following:
A program that checks a Directed Graph if there's a cycle that ends at it's beginning, and visits each point just once.
The graph should be used as a...
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.