test(dsl): add modern graph algorithm cases - #815
Merged
Leomrlin merged 1 commit intoAug 3, 2026
Conversation
Leomrlin
approved these changes
Aug 3, 2026
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
3 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.
Summary
Expected results
CC
The current implementation propagates the minimum string label through incoming edges. Each vertex therefore reports the minimum ID in its forward-reachable set: 1->1, 2->2, 3->3, 4->3, 5->5, and 6->3.
WCC
Treating the edges as undirected makes all six vertices connected, so every vertex reports component 1.
KCore
For k=2, vertices 2, 5, and 6 have degree 1 and are removed. Vertices 1, 3, and 4 form a triangle and remain with degree 2.
Tests
Related to #794