isLoopless(G)
This method checks whether a graph contains a loop.
If the input is a Graph or a Bigraph, then this is equivalent to isSimple.
If the input is a Digraph, then this is equivalent to checking whether the underlyingGraph isSimple.
If the input is a MixedGraph, then this checks whether the undirected, directed and bidirected subgraphs separately contain loops.
|
|
|
|
|
|
|
The object isLoopless is a method function.
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/StatGraphs.m2:854:0.