Skip to content

Adding quickcheck for hex lattice graph#1477

Merged
IvanIsCoding merged 1 commit into
Qiskit:mainfrom
Krishn1412:quickcheck_hexlattice_graph
Jul 6, 2025
Merged

Adding quickcheck for hex lattice graph#1477
IvanIsCoding merged 1 commit into
Qiskit:mainfrom
Krishn1412:quickcheck_hexlattice_graph

Conversation

@Krishn1412

Copy link
Copy Markdown
Contributor

This test verifies:

  1. Number of nodes and edges generated matches the expected formula based on rows, cols, and whether the graph is bidirectional and non-periodic.
  2. For every edge, the reverse edge exists if bidirectional is true.
  3. Each node in a hexagonal_lattice_graph_weighted graph has the correct (u, v) weight based on its intended lattice position.
  4. Invalid periodic graphs (with odd cols or small rows) are correctly rejected with an error.

This test verifies:
1. Number of nodes and edges generated matches the expected formula based on rows, cols, and whether the graph is bidirectional and non-periodic.

2. For every edge, the reverse edge exists if bidirectional == true.

3. Each node in a hexagonal_lattice_graph_weighted graph has the correct (u, v) weight based on its intended lattice position.
4. Invalid periodic graphs (with odd cols or small rows) are correctly rejected with an error.
@coveralls

Copy link
Copy Markdown

Pull Request Test Coverage Report for Build 16088388654

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 94.619%

Totals Coverage Status
Change from base Build 16061906998: 0.0%
Covered Lines: 17760
Relevant Lines: 18770

💛 - Coveralls

@IvanIsCoding IvanIsCoding added this pull request to the merge queue Jul 6, 2025
Merged via the queue into Qiskit:main with commit 46ff474 Jul 6, 2025
36 checks passed
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