Add potentially connected check for degree sequences - #2924
Draft
Tagl wants to merge 2 commits into
Draft
Conversation
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## main #2924 +/- ##
==========================================
+ Coverage 75.53% 75.55% +0.02%
==========================================
Files 406 406
Lines 75426 75541 +115
Branches 15081 15112 +31
==========================================
+ Hits 56974 57078 +104
- Misses 18452 18463 +11
Continue to review full report in Codecov by Harness.
🚀 New features to boost your workflow:
|
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
1 participant
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.
Adds the function
is_potentially_connectedwhich takes as input a degree sequence for the undirected case or degree sequences for the directed case.The function assumes the input has been checked previously to be graphical.
The function returns true if there exists at least one realization which is weakly or strongly connected, depending on chosen mode.
The function supports simple graphs with or without loops and multigraphs with or without loops, with the exception of strongly connected simple graphs with self-loops, which returns IGRAPH_UNIMPLEMENTED for now.
The time complexity and memory complexity of the function is$\mathcal{O}(n)$ and the bucket sort used is implemented in a way that minimizes allocations, similar to existing implementation of
is_graphical_directed_simple