Skip to content

Conversation

Krishn1412
Copy link
Contributor

The quickcheck tests for the following properties:

Node count is exactly num_nodes.

Edge count is at most num_nodes - 1 (a tree has n-1 edges).

This QuickCheck test verifies structural properties of barbell_graph.

It ensures the total number of nodes is 2 × mesh_size + path_size.

It checks the number of edges matches the expected sum of two cliques, path edges, and connectors.
We add quickcheck to test the following properties of a full rary tree graph:

Node count is exactly num_nodes

Edge count is at most num_nodes - 1 (a tree has n-1 edges)
The quickcheck tests for the following properties:

Node count is exactly num_nodes.

Edge count is at most num_nodes - 1 (a tree has n-1 edges).
@coveralls
Copy link

coveralls commented Jun 21, 2025

Pull Request Test Coverage Report for Build 15807495633

Details

  • 0 of 0 changed or added relevant lines in 0 files are covered.
  • No unchanged relevant lines lost coverage.
  • Overall coverage remained the same at 95.201%

Totals Coverage Status
Change from base Build 15799699615: 0.0%
Covered Lines: 19383
Relevant Lines: 20360

💛 - Coveralls

@IvanIsCoding IvanIsCoding added this pull request to the merge queue Jun 22, 2025
Merged via the queue into Qiskit:main with commit d32e3d8 Jun 22, 2025
31 checks passed
SILIZ4 pushed a commit to SILIZ4/rustworkx that referenced this pull request Jul 4, 2025
* Adding quickcheck for barbell graphs

This QuickCheck test verifies structural properties of barbell_graph.

It ensures the total number of nodes is 2 × mesh_size + path_size.

It checks the number of edges matches the expected sum of two cliques, path edges, and connectors.

* Adding quickcheck for full rary tree

We add quickcheck to test the following properties of a full rary tree graph:

Node count is exactly num_nodes

Edge count is at most num_nodes - 1 (a tree has n-1 edges)

* Adding quickcheck test for full rary tree graph

The quickcheck tests for the following properties:

Node count is exactly num_nodes.

Edge count is at most num_nodes - 1 (a tree has n-1 edges).
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants