Graph Matching and Comparison #3

Description

Implement algorithms to compare student graphs with expected answer graphs, supporting exact matching, isomorphism checking, and subgraph verification.

Tasks

• Implement exact graph matching (node and edge comparison)
• Implement graph isomorphism checking (for small graphs)
• Implement subgraph detection
• Add support for ignoring labels/weights in comparison
• Create detailed mismatch reporting (missing nodes, extra edges, etc.)
• Write unit tests with various graph configurations
• Optimize for performance on larger graphs

Acceptance Criteria

• Exact matching works for identical graphs
• Isomorphism detection works for graphs up to 10 nodes
• Subgraph detection correctly identifies valid subgraphs
• Detailed feedback shows what differs between graphs
• Unit tests cover all match types