Implement CFL all-paths path-finding#9
Open
DanyaLitva wants to merge 43 commits intoSparseLinearAlgebra:stablefrom
Open
Implement CFL all-paths path-finding#9DanyaLitva wants to merge 43 commits intoSparseLinearAlgebra:stablefrom
DanyaLitva wants to merge 43 commits intoSparseLinearAlgebra:stablefrom
Conversation
All Paths Dev
Update LAGraph_CFL_AllPaths.c
Author
|
Проверил алгоритм на примере из статьи Рустама Азимова Из статьи: Из программы: |
gsvgit
reviewed
Mar 5, 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
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.
This PR adds an implementation algorithm for finding all paths based on the implementation of Rustam Azimov's algorithm for finding a single path and all paths in a graph with context-free constraints using matrix multiplication. Based on CFPQ-Core from #8