chickadee » graphs » semantic-feasibility?

semantic-feasibility? G1 G2 s n mprocedure

Evaluates semantic feasibility of adding vertices n from G1 and m from G2 to the partial mapping s. This can be done by evaluating the vertex attributes between n and m, or by evaluating the edge attributes of n and its neighbours in G1 to that of m and its neighbours in G2.

the first graph
the second graph
the partial mapping between G1 and G2. Represented as a set of pairs (N . M) of feasible matches between G1 and G2
a candidate vertex from G1
a candidate vertex from G2