Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Implement faster distance algorithm #125

Merged
merged 1 commit into from
Oct 14, 2024
Merged

Conversation

N-Wouda
Copy link
Member

@N-Wouda N-Wouda commented Oct 13, 2024

Closes #117.

@N-Wouda N-Wouda requested a review from leonlan October 13, 2024 21:27
Copy link

codecov bot commented Oct 13, 2024

Codecov Report

All modified and coverable lines are covered by tests ✅

Please upload report for BASE (main@3c9e2f4). Learn more about missing BASE report.

Additional details and impacted files
@@           Coverage Diff            @@
##             main      #125   +/-   ##
========================================
  Coverage        ?   100.00%           
========================================
  Files           ?        19           
  Lines           ?       319           
  Branches        ?         0           
========================================
  Hits            ?       319           
  Misses          ?         0           
  Partials        ?         0           

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

@leonlan leonlan merged commit 04ce196 into main Oct 14, 2024
7 checks passed
@leonlan leonlan deleted the faster-distance-calculation branch October 14, 2024 06:52
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.

Parse large instances with 15K or 30K nodes
2 participants