Additional Exercise for Chapter 6 -- Finding Basic Loops A path is called basic if it contains no repetions of loops. Find all basic loops in a directed graph. Hint: A path consisting of links of the form in(X,Y) is a basic loop iff all its nodes are connected with each other.