Adding Quickcheck for cycle graph #1473
Merged
Conversation
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
We are testing the structural property of cycle graph by ensuring: Node count is exactly n Edge count is: n for directed, non-bidirectional 2n for directed, bidirectional n for undirected All expected edges are present In bidirectional mode: for every (u, v) edge, there’s also a (v, u) edge
SILIZ4
pushed a commit
to SILIZ4/rustworkx
that referenced
this pull request
Jul 4, 2025
We are testing the structural property of cycle graph by ensuring: Node count is exactly n Edge count is: n for directed, non-bidirectional 2n for directed, bidirectional n for undirected All expected edges are present In bidirectional mode: for every (u, v) edge, there’s also a (v, u) edge
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.
We are testing the structural property of cycle graph by ensuring:
Node count is exactly n
Edge count is:
n for directed, non-bidirectional
2n for directed, bidirectional
n for undirected
All expected edges are present
In bidirectional mode: for every (u, v) edge, there’s also a (v, u) edge