Acyclic graph
From Wikipedia, the free encyclopedia
An acyclic graph may refer to:
- Directed acyclic graph, a directed graph without any directed cycles
- Forest (graph theory), an undirected acyclic graph
- Polytree, a directed graph without any undirected cycles
 |
This disambiguation page lists mathematics articles associated with the same title. If an internal link led you here, you may wish to change the link to point directly to the intended article. |
