Skip to content
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
wants to merge 51 commits into
base: main
Choose a base branch
from

Conversation

SurfaceYellowDuck
Copy link

Implemented type checker and interpreter for Graph Query Language

“SurfaceYellowDuck” and others added 30 commits September 9, 2024 14:51
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
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.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant