Skip to content

Conversation

Krishn1412
Copy link
Contributor

Added a check to test the principle that for undirected non-negative weights, Bellman Ford and Dijkstra's algorithm must produce the same shortest distance.

Next, will start on adding fuzz targets for connectivity and generator modules.

Added a check to test the principle that for undirected non-negative weights, Bellman Ford and Dijkstra's algorithm must produce the same shortest distance.

Next, will start on adding fuzz targets for connectivity and generator modules.
@coveralls
Copy link

Pull Request Test Coverage Report for Build 14383080439

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.84%

Totals Coverage Status
Change from base Build 14370793558: 0.0%
Covered Lines: 18637
Relevant Lines: 19446

💛 - Coveralls

Copy link
Collaborator

@IvanIsCoding IvanIsCoding left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

LGTM

@IvanIsCoding IvanIsCoding added this pull request to the merge queue Apr 10, 2025
Merged via the queue into Qiskit:main with commit 74cf811 Apr 10, 2025
31 checks passed
SILIZ4 pushed a commit to SILIZ4/rustworkx that referenced this pull request Jul 4, 2025
Added a check to test the principle that for undirected non-negative weights, Bellman Ford and Dijkstra's algorithm must produce the same shortest distance.

Next, will start on adding fuzz targets for connectivity and generator modules.
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