Assertion: graph | /r/HasProperty | acyclic
Facets:
Source sentences:
text: Therefore, every graph with a topological ordering is acyclic.
text: A graph without cycles is called an acyclic graph.
text: When the graph is already acyclic, its smallest feedback vertex sets and feedback arc sets are empty, and its condensation is the graph itself.
text: 1 // empty graph is acyclic