Expand description
Subgraph pattern matching for anti-pattern detection
Find specific graph patterns (e.g., code smells, anti-patterns). Based on subgraph isomorphism and motif detection algorithms.
§References
- Kim et al. (2023): “Efficient Subgraph Matching on Large Graphs”
- Cordella et al. (2004): “VF2 algorithm for subgraph isomorphism”
Structs§
- Pattern
- Pattern specification for matching
- Pattern
Match - Pattern matching result
Enums§
- Severity
- Severity level for anti-patterns
Functions§
- find_
patterns - Find all pattern matches in the graph