An acyclic graph is a "graph with no path that starts and ends at the same vertex".[1]
References[]
- ↑ Paul E. Black, "acyclic graph", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 19 April 2004. (accessed 15 Oct. 2015) Available from: <http://www.nist.gov/dads/HTML/acyclicgraph.html>