I am still not entirely convinced this is not a FSA task again, why dont we just copy the schema from FSA-eval then add some custom validation function as per requirements
Interactive UI for creating and analysing graphs. Evaluation checks properties such as connectivity, shortest paths, and bipartite status.
-
- schema (this seems partially completed for me, FSAs should work the same, all nodes and edges)
-
- connectivity check, simple bfs/dfs should do, are some graph theory lemmas
-
- shortest path dijkstra should do
-
- what else do we need
frontend may still be in another repo
I am still not entirely convinced this is not a FSA task again, why dont we just copy the schema from FSA-eval then add some custom validation function as per requirements
Interactive UI for creating and analysing graphs. Evaluation checks properties such as connectivity, shortest paths, and bipartite status.frontend may still be in another repo