Cycle (graph theory)
Cycle (graph theory) 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.cyclegraphmathematicslink