IsLoopFreeGraph

Whether a Graph has no self-loop.

✓ checked against that system · ! checked, with disagreements (hover a chip)Wolfram LanguageLoopFreeGraphQ✓↗

IsLoopFreeGraph(g)true iff no edge of g joins a vertex to itself.

Typed signatures

Type	Package	Applies
(value) -> boolean	combinatorics	always

Domain: Collections

Details

• Wolfram calls this LoopFreeGraphQ; this library uses the Is… spelling everywhere.

Examples

Basic #

live ↗

In$\mathrm{IsLoopFreeGraph}(\mathrm{Graph}(\bigl\lbrack\mathrm{UndirectedEdge}(1, 2)\bigr\rbrack))$Out$\mathrm{True}$

live ↗

In$\mathrm{IsLoopFreeGraph}(\mathrm{Graph}(\bigl\lbrack\mathrm{UndirectedEdge}(1, 1)\bigr\rbrack))$Out$\mathrm{False}$

About

Examples	2
Checked against	Wolfram Language 2 agreeSageMath 2 agree
Crosswalk	Wolfram Language

Implementation

mappedsagepackages/oracle/src/mappings.ts

See also: IsSimpleGraph