# Acyclic Graph

Jump to navigation
Jump to search

An Acyclic Graph is a graph with no graph cycles.

**Context:**- It can be:
- It can be:
- …

**Example(s):****See:**Cyclic Graph.

## References

- http://en.wikipedia.org/wiki/Acyclic_graph#Walks
- A graph is acyclic if it contains no cycles; unicyclic if it contains exactly one cycle; and pancyclic if it contains cycles of every possible length (from 3 to the order of the graph).