Yes! In fact, I already listed-up my future plan for refactoring the code at the readme. One of the plan is to use file I/O to get the graph structure and the rules.
I expect there would be existing solutions for (de)serializing the generic graph. One tricky thing (I think) is to encode the connection rules in some parsable format.
I'm planning on extending the connection rule to propositional logic and find some fancy way to efficiently en(de)code the PL formula.
Maybe I should spend some more nights to refactor my ugly code :P anyway thanks for the reply!
I expect there would be existing solutions for (de)serializing the generic graph. One tricky thing (I think) is to encode the connection rules in some parsable format.
I'm planning on extending the connection rule to propositional logic and find some fancy way to efficiently en(de)code the PL formula.
Maybe I should spend some more nights to refactor my ugly code :P anyway thanks for the reply!