-
Notifications
You must be signed in to change notification settings - Fork 139
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Task 12. Graph Query Language Interpreter #191
Open
SurfaceYellowDuck
wants to merge
51
commits into
FormalLanguageConstrainedPathQuerying:main
Choose a base branch
from
SurfaceYellowDuck:Homework12
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Task 12. Graph Query Language Interpreter #191
SurfaceYellowDuck
wants to merge
51
commits into
FormalLanguageConstrainedPathQuerying:main
from
SurfaceYellowDuck:Homework12
Conversation
This file contains 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
Add functionality for creating a graph from two cycles Add tests for the functions listed above
Task 1: Init working environment
add tests for synthetic graph and graph from file enabled autotests
Removed the redundant code, replaced it with imports Add tests in which only initial or only final states are passed to the function
Task2: Construction of a deterministic finite automaton by a regular expression and a non-deterministic finite automaton by a graph
add intersection function for two automata add tensor_based_rpq function
Task 3. Regular queries for all pairs of nodes
This function let you get a states by indexes
Add: add get_states_by_indexes function
add: add tool for creating boolean vector
fix: refactored code
Task 4. Regular queries for several starting vertices
add add hellings based algorithm that decides reachability task for all pairs of vertices.
Task 6. Grammar conversion to WCNF, the Hellings algorithm
add matrix based algorithm that decides reachability task with context-free constraints for all pairs of vertices.
add: add matrix based cfpq
fix: changed storing format
fix new_states
Task 8. Tensor algorithm for solving the reachability problem with CS constraints
Task 9. Algorithm for solving the reachability problem with CS constraints, based on GLL
- changed recursive methods of building string to visitor/listener. - samily with counting nodes of tree
Task 11. Graph query language
fix: lints fix: lints
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Implemented type checker and interpreter for Graph Query Language