Open
Conversation
dbaston
reviewed
Mar 25, 2026
dbaston
reviewed
Mar 27, 2026
| * | ||
| * \param geoms Input array of Curves. Non-Curve geometries are ignored. | ||
| * \param ngeoms Number of geometries in the input array. | ||
| * \return An array of size_t of size ngeoms. 0 if the edge is not in the MST. |
Member
There was a problem hiding this comment.
Semantics are somewhat different from the clustering functions, does it make sense to return a GEOSClusterInfo* ?
Member
Author
There was a problem hiding this comment.
I went back and forth on that... functionally it's doing the thing I want, so maybe it's the right answer slightly off-kilter naming be damned. Was is your feel?
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
2 participants
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.
Given a set of curves, form a graph using coincident start/end points as the nodes. Kruskal algorithm calculates the shortest set of edges that connect every node in the graph. Exposed in CAPI as GEOSMinimumSpanningTree. This feature was built with the help of Gemini.