Cycle (graph theory)

Trail in which only the first and last vertices are equal

In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is a non-empty directed trail in which only the first and last vertices are equal. A graph without cycles is called an acyclic graph (or a forest).

From Wikipedia, under CC BY-SA. More on occurri.