Repository navigation
docs: README benchmark tables after the speed-ups - #67
Merged
Merged
Conversation
Measured on main with the faster planners, the components union-find and the vertex coordinate made with np.array: creating a vertex is 0.9 us, the components after a change are 4 ms (undirected) and 6 ms (directed) at 10,000 vertices, and a path query is 3 to 10 ms. Co-Authored-By: Claude Sonnet 5.5 <noreply@anthropic.com>
Up to standards ✅🟢 Issues
|
Codecov Report✅ All modified and coverable lines are covered by tests. Additional details and impacted files@@ Coverage Diff @@
## main #67 +/- ##
=======================================
Coverage 97.26% 97.26%
=======================================
Files 3 3
Lines 1570 1570
=======================================
Hits 1527 1527
Misses 43 43 ☔ View full report in Codecov by Harness. 🚀 New features to boost your workflow:
|
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
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.
Regenerates the two benchmark tables in the README on current
main, which now has the planner speed-up (#54), the components union-find (#63), the vertex constructor (#62) and the vertex coordinate made withnp.array(#66).At 10,000 vertices, undirected / directed:
Only vertex creation changed materially; the other rows are within the run-to-run spread of a laptop (about ±15%).
One note: creating a vertex in a directed graph of 10,000 vertices reads either 0.86 or 1.93 µs from run to run, which is a pause (probably the cyclic garbage collector) and not the code; the table is one complete run, the lower one. The 100- and 1,000-vertex columns are steady.
🤖 Generated with Claude Code