In a non-directional line, you can point all the sides of the line exactly once in both directions. Write the circulating algorithm as Python code. Here, what is meant by the phrase "in both directions", assuming that it has u and v nodes at both ends of an edge, your algorithm is less nor more) from u to v, exactly once (neither less nor more) from v to u should progress. Hint: Considered modifying the DFS algorithm accordingly.