Open
Conversation
add algorithm to find cut edges (bridges) --------- Co-authored-by: Maycon Sambinelli <[email protected]>
Member
|
Regarding the bridge finding algorithm, there is another PR, which implemented such an algorithm. I compared the performance of this implementation to the one suggested in the other PR, and the other implementation seems to be 2-7 times faster. The benchmark setup can be found here. I just added a The results from this implementation are: While the results of the implementation from the other PR are: Note that in order to be able to run the benchmarks with the other PR, I had to rebase. The setup of the same benches/bridges.rs file can be found here. |
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
2 participants
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.
Add Connectivity Algorithms
Algorithms:
References:
The algorithm to find Bridges was inspired by the following Program from the book Algorithms in C, Third Edition, Part 5, by Robert Sedgewick, adapted to Rust and to use Petgraph traits, also transformed into an iterative algorithm instead of a recursive one.
The other connectivity algorithms in the PR are adaptations of it.