Commit 2024-07-08 19:04 abfa3788

View on Github →

feat(Combinatorics/SimpleGraph): vertices are not reachable iff set of walks between them is empty (#14315) This lemma came up while extending SimpleGraph.dist to ENat.

Estimated changes