Assertion: graph's path | /r/Synonym | cycle
Facets:
Source sentences:
text: A path which starts and ends at the same edge is called a cycle.
text: If a vertex can reach itself via a nontrivial path (a path with one or more edges), then that path is a cycle, so another way to define directed acyclic graphs is that they are the graphs in which no vertex can reach itself via a nontrivial path.
text: The path is called a cycle if v i 1 ≡