@graphty/algorithms / index / IsomorphismResult

Interface: IsomorphismResult

Defined in: algorithms/matching/isomorphism.ts:17

Graph Isomorphism (VF2) algorithm implementation

Determines if two graphs are isomorphic (structurally identical). Two graphs are isomorphic if there exists a bijection between their vertices that preserves adjacency.

Based on the VF2 algorithm by Cordella et al. (2004)

Time complexity: O(n! × n) worst case, but typically much faster Space complexity: O(n)

Properties

isIsomorphic

isIsomorphic: boolean

Defined in: algorithms/matching/isomorphism.ts:18

---

mapping?

optional mapping: Map<NodeId, NodeId>

Defined in: algorithms/matching/isomorphism.ts:19