Mathlib Map

Theorems · Definition · combinatorics

Quiver.shortestPath

{V : Type u} → [inst : Quiver V] → (r : V) → [Quiver.RootedConnected r] → (b : V) → Quiver.Path r b

A path from r of minimal length.

Defined in
Mathlib.Combinatorics.Quiver.Arborescence
Cited by
2 results in Mathlib
Foundations
Depth 16 from the axioms · uses propext, Classical.choice, Quot.sound
Assumes
QuiverQuiver.RootedConnected
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Quiver.shortestPath.congr_simp · cited by 0shortestPath.congr_simpQuiver.shortest_path_spec · cited by 0Quiver.shortest_path_specQuiver.geodesicSubtree · cited by 0Quiver.geodesicSubtreeSet.univ · cited by 3945Set.univQuiver · cited by 405QuiverQuiver.Path · cited by 166Quiver.PathWellFounded.min · cited by 33WellFounded.minQuiver.RootedConnected · cited by 2Quiver.RootedConnectedQuiver.shortestPathCITED BYCITES

Cites5

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by3

Results whose statement or proof uses this declaration.