Theorems · Definition · combinatorics

SimpleGraph.Walk.edges

{V : Type u} → {G : SimpleGraph V} → {u v : V} → G.Walk u v → List (Sym2 V)

The edges of a walk is the list of edges it visits in order. This is defined to be the list of edges underlying SimpleGraph.Walk.darts.

Defined in

Mathlib.Combinatorics.SimpleGraph.Walk.Basic

Cited by

145 results in Mathlib

Foundations

Depth 8 from the axioms, rests on 37 definitions · uses no axioms