-
Notifications
You must be signed in to change notification settings - Fork 216
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
Merge September to early February #417
Open
jeremy-murphy
wants to merge
62
commits into
master
Choose a base branch
from
develop
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Conversation
This file contains 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
Remove unnecessary dir prefix
Fix issue #384: broken links between disjoint_sets and incremental connected components
Update publications.html
fixed incorrect callbacks to finish_edge in undirected_dfs
bron_kerbosch_all_cliques: Fix unused parameter/variable warnings
Fix missing detail:: namespace qualification on call to cycle_canceling_dispatch1.
Without this check, the test program declares all tests passed if it fails to open the input file.
Fix time complexity spec of vertex()
"crosses" fits the requirement as it means that the interior parts of the geometry share some common points, not exterior parts such as end-points, and it means "not within".
Replace std::deque with std::vector for Lengauer-Tarjan
…-cpp-attempt2 Examples: Fix minor warnings
Fix performance issues for vector-based storage Also remove requirement for a mutable graph on vertex_by_property().
Fix GHA build status badges in Readme
Fix geometry bug in is_straight_line_drawing
…-cpp-attempt2 examples: C++11: Use auto
Ensure named_graph base class is initialized before accessing it
Also remove unnecessary < > spaces around template arguments.
Remove Boost.Assign usages.
Replace implementation of maximum_weighted_matching() Based on a paper by Zvi Galil. The new code runs in time O(V^3).
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.
Lots of good bug fixes and update to documentation.