feat(bfs): replace old broken bfs functions with a new shortest_path udf#54
Draft
RoyalMirMak wants to merge 8 commits into
Draft
feat(bfs): replace old broken bfs functions with a new shortest_path udf#54RoyalMirMak wants to merge 8 commits into
RoyalMirMak wants to merge 8 commits into
Conversation
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.
Add shortest_path table function using bidirectional BFS for efficient pathfinding in GraphAr edge tables. Replaces deprecated BFS scalar function, supports directed graphs, and handles edge cases like invalid IDs and unreachable paths. Includes 13 comprehensive tests and removes obsolete bfs code.