Question: How is this different from FSA #1

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.

• 1. schema (this seems partially completed for me, FSAs should work the same, all nodes and edges)
• 2. connectivity check, simple bfs/dfs should do, are some graph theory lemmas
• 3. shortest path dijkstra should do
• 4. what else do we need

frontend may still be in another repo