Structures · Combinatorics
Graph.Simple
A Simple graph is a Loopless graph where no pair of vertices are the ends of more than one
edge.
- Defined in
- Mathlib.Combinatorics.Graph.Simple
- Shape
- One type argument · adds eq_of_isLink
Extends1
Extended by0
Nothing extends this class yet.
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…