/**
* Finds the matching vertices between graphs g1 and g2
*
* @param g1
* @param g2
* @param threshold - if node similarity is >= than threshold then these nodes are considered to
* be matched.
* @param stemmer - stemmer for wrord stemming, if == null, then english stemmer is used
* @return matching vertex pairs
*/
public static ArrayList<VertexPair> getMappingsGraph(
Graph g1, Graph g2, double threshold, SnowballStemmer stemmer) {
ArrayList<Vertex> g1Vertices = g1.getFunctions();
ArrayList<Vertex> g2Vertices = g2.getFunctions();
if (Settings.considerEvents) {
g1Vertices.addAll(g1.getEvents());
g2Vertices.addAll(g2.getEvents());
}
return getMappingsVetrex(g1Vertices, g2Vertices, threshold, stemmer, 0);
}
