Add shortest-path and related distance & diameter algorithms#3
Merged
Conversation
Welcome to Codecov 🎉Once you merge this PR into your default branch, you're all set! Codecov will compare coverage reports and display results in all future pull requests. Thanks for integrating Codecov - We've got you covered ☂️ |
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.
Implemented the recent heuristic (DOI: 10.1186/s13015-022-00217-9) and exact (DOI: 10.1089/cmb.2023.0242) algorithms for shortest-path search in directed hypergraphs. Both algorithms were originally developed by Krieger & Kececioglu.
With the ability to perform (reasonably) efficient pathfinding, we can also calculate distances between vertices (extending the pathfinding capabilities of SimpleHypergraphs.jl) and calculate the diameter of a directed hypergraph (extending
Graphs.diameter).