how to visit each point in directed graph

Question

In Prolog, how can I implement graph algorithm in order to find all path in order to implement travel salesman problem in directed graph ?

example :

Answer 1

Keep a list of nodes you have already visited. In each step, check if the endpoint of the edge exists in the list or not.