Definition
A cycle in a Graph is a non-trivial Path that starts and ends at the same node.
In an Undirected Graph, a cycle must visit at least three distinct nodes before returning to the starting node. In a Directed Graph, a cycle follows outgoing edges only.
Related Concepts
- Directed Acyclic Graph: A graph with no directed cycles
- Tree: A graph without cycles