feat(Combinatorics/SimpleGraph/Paths): existence of a shortest cycle at a vertex#41711
Open
SnirBroshi wants to merge 1 commit into
Open
Conversation
PR summary 1450ccebb1Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Longest paths/trails/cycles/circuits are handled in #41522
For circuits not fixed to a specific vertex we have
exists_girth_eq_lengthandIsCircuit.girth_le_length.A shortest circuit is a cycle and every cycle is a circuit, so there's no reason to have separate circuit/cycle versions, unlike the "longest" versions.
Note that the notion of shortest paths/trails (either globally or from a specific vertex) doesn't make sense because the nil walk is a path/trail. However a shortest path/trail between two specific endpoints does make sense, and we have
Reachable.exists_path_of_distanddist_lefor that case.