Merged
Conversation
…im() parameters: (g, seed, predecessor, weight, ...)\n- Replace hand-rolled priority queue with dijkstra delegation\n using prim_combine = [](EV, EV w_uv) -> EV { return w_uv; }\n- Align initialization contract with dijkstra: simple overload\n calls init_shortest_paths(); full overload requires pre-init\n- Use adjacency_list + vertex_property_map concepts (generic)\n- Eliminate init_dist parameter\n- Update all test and example call sites"
Remove the simple prim(g, seed, predecessor, weight) overload and add a default WF parameter to the full overload that returns edge_value(g, uv). All callers now consistently must call init_shortest_paths() before prim().
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.
Update prim(() to use dijkstra_shortest_paths() and reduce overloads