Cycle (graph theory)Cycle
Trail in which only the first and last vertices are equalSuite de sommets d'un graphe débutant et finissant au même sommet
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.Dans un graphe non orienté, un cycle est une suite d'arêtes consécutives distinctes (chaine simple) dont les deux sommets extrémités sont identiques.
