Assertion: graph | /r/HasAspect | loop
Facets:
Source sentences:
text: However, since our graphs can have loops, we need to make sure we don't enter an infinite cycle.
text: Simple directed graphs are directed graphs that have no loops (arrows that directly connect vertices to themselves) and no multiple arrows with same source and target nodes.
text: are directed graphs that have no loops (arrows that directly connect vertices to themselves) and no multiple arrows with same source and target nodes.
text: For instance, this graph is acyclic because it has no loops.