Structures · Combinatorics
Graph.Loopless
A loopless graph is one where the ends of every edge are distinct.
- Defined in
- Mathlib.Combinatorics.Graph.Simple
- Shape
- One type argument · adds not_isLoopAt
Extends0
Extends nothing: this is a root of the hierarchy.
Extended by1
Concrete types that are instances0
No instance on a concrete type; it is reached through other classes.
How is a type an instance?
Loading the hierarchy index…
Assumed by9
Ancestors0
No ancestors.