This project's aim is to build a graph engine, that is able to build and compare graphs - and to match patterns and apply actions on the graph, to effectively use it as a graph-transformation framework.
BSD 3-Clause "New" or "Revised" License
1
stars
0
forks
source link
evaluate whether backjumping could be implemented #33
At time of the colloquium being not sure, if backjumping is used, yet, I looked into it and found, that it isn't. Whether or not it could be used in these algorithms, though, should be evaluated.
[ ] evaluate whether backjumping could be implemented for isomorphic checks / pattern matching
At time of the colloquium being not sure, if backjumping is used, yet, I looked into it and found, that it isn't. Whether or not it could be used in these algorithms, though, should be evaluated.