A graph is cyclic if it contains at least one cycle (no repeated edges and nodes, starts and ends at same node).