Repository navigation
examples: benchmark of the key operations - #55
Merged
Merged
Conversation
Times building, copying, pickling, components, closest, the matrix forms and the three path planners on seeded random geometric graphs of 100, 1 000 and 10 000 vertices, with the growth exponent between the smallest and largest. --directed, --quick, --sizes, --plot and --rst (a table for the docs). Co-Authored-By: Claude Sonnet 5.5 <noreply@anthropic.com>
Co-Authored-By: Claude Sonnet 5.5 <noreply@anthropic.com>
Up to standards ✅🟢 Issues
|
| Metric | Results |
|---|---|
| Complexity | 74 |
| Duplication | 0 |
NEW Get contextual insights on your PRs based on Codacy's metrics, along with PR and Jira context, without leaving GitHub. Enable AI reviewer
TIP This summary will be updated as you push new changes.
Codecov Report✅ All modified and coverable lines are covered by tests. Additional details and impacted files@@ Coverage Diff @@
## main #55 +/- ##
=======================================
Coverage 96.61% 96.61%
=======================================
Files 3 3
Lines 1358 1358
=======================================
Hits 1312 1312
Misses 46 46 ☔ View full report in Codecov by Harness. 🚀 New features to boost your workflow:
|
Co-Authored-By: Claude Sonnet 5.5 <noreply@anthropic.com>
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
examples/benchmark.py: times building, copying, pickling, components,closest, the matrix forms and the three path planners on seeded random geometric graphs of 100, 1 000 and 10 000 vertices, and prints a table with the growth exponent between the smallest and largest size.--directedusesDGraph;--quickskips the largest graph;--sizes,--seed,--matrix-max.--rstprints the table as a reSTlist-tablefor the docs.--plotalso timesplot()plus a draw (off by default, backend dependent).path_UCSandpath_Astardisagree on the path cost.--quick.Also completes a sentence in
examples/README.mdthat had been cut off mid-line, and documents the benchmark there.It already earned its keep: it showed
path_BFSgrowing as roughly N^1.8, fixed in #54.Not wired into CI; timings depend on the machine.
🤖 Generated with Claude Code