public class GraphMatcher extends Object
Modifier and Type | Method and Description |
---|---|
static boolean |
equals(Graph m1,
Graph m2)
Are the two models isomorphic?
The isomorphism is defined as a bijection between the anonymous
variables such that the statements are identical.
|
static int |
hashCode(Graph g) |
static Node[][] |
match(Graph m1,
Graph m2)
Return an isomorphism between the two models.
|
public static boolean equals(Graph m1, Graph m2)
public static int hashCode(Graph g)
public static Node[][] match(Graph m1, Graph m2)
null
on failure or an array of related pairs
(arrays of length 2) of anonymous nodes.
match(m1,m2)[i][0]
is from m1
,
and match(m1,m2)[i][1]
is the corresponding node in
m2
.Licenced under the Apache License, Version 2.0