Theorem SimpleGraph.Reachable.of_dist_ne_zero

Modification history

2024-07-27 14:22
Mathlib/Combinatorics/SimpleGraph/Metric.lean
feat(Combinatorics/SimpleGraph): define `edist` and rewrite `dist` (#14582) …
Modified SimpleGraph.Reachable.of_dist_ne_zeroView on Github →
2024-05-24 20:28
Mathlib/Combinatorics/SimpleGraph/Metric.lean
feat(Combinatorics/SimpleGraph): Distance between `u` and `v` is one iff `u` and `v` are adjacent (#11945) …
Added SimpleGraph.Reachable.of_dist_ne_zeroView on Github →