The goal of this prototype is to implement a simple algorithm for detecting simple cycles within a graph.

Let G = (V,E) be a directed graph (G) consists of a finite set of vertices (V) and a finite set of edges (E). Each edge describes a relationship v₁ → v₂ where v₁ and v₂ are distinct members of V.

Within G a cycle of length l is a sequence of vertices [v₀,v₁,…,v_l] where v_i]-1 → _i] for i = 1, 2, …., l-1 and v_l → v₁.

The cycle is simple when each vertex in [v₀,v₁,…,v_l] are destinct, so that v_i ≠ v_j for i ≠ j.

* Golumbic, M. C. (2004). Algorithmic Graph Theory and Perfect Graphs (2nd ed., Chapter 1 - Graph Theoretic Foundations). North Holland Publishing Company, a Subsidiary of Eslevier.