If a path is Simple Path, and it starts and ends at the same vertex, then the path is a CYCLE. A Cycle is like a circle; it starts at one point and ends at the same point.

It is important to note that the same edge cannot be used more than once in a cycle.

A graph is called ACYCLIC if there are no cycles in it.

In the first example, the path {CDEGJIFC} is a cycle.

The second graph does not contain cycles.

Choose topics to learn more about graph and graph algorithms

Back to AlgoNet Home