Replace
(and $A_1$ is transformed to $T_1$)
by
(and $A_1$ is transformed to $T_2$)
Replace
$\mathit{first}[v]=\mathit{first}[w]$
by
$(\mathit{first}[v],\mathit{first}[w]) \in M$
and replace
$\mathit{next}[v]=\mathit{next}[w]$
by
$(\mathit{next}[v],\mathit{next}[w]) \in M$
Replace
$\mathit{parent}[v]=\mathit{parent}[w]$
by
$(\mathit{parent}[v],\mathit{parent}[w]) \in M$
Replace
The algorithm for bottom-up unordered subtree isomorphism
by
The algorithm for bottom-up unordered maximum common
subtree isomorphism
Replace label v5 along the v3 v4 v5 v7 path in Fig. 6.3 by v6.
Replace
bool independent;
by
bool independent = false;
Replace
if ( T.number_of_nodes() == 1 ) {
C.insert(T.first_node() );
} else {
by either if ( T.number_of_nodes() == 1 ) {
// C.insert(T.first_node() );
} else {
or
if ( T.number_of_nodes() != 1 ) {
Replace
if ( G.number_of_nodes() == 1 ) {
C.insert(G.first_node() );
} else {
by either if ( G.number_of_nodes() == 1 ) {
// C.insert(G.first_node() );
} else {
or
if ( G.number_of_nodes() != 1 ) {
Replace
( A1(v,w) != nil && A2(M[v],M[w]) == nil &&
G1[A1(v,w)] != G2[A2(M[v],M[w])] )
by
( A1(v,w) != nil && A2(M[v],M[w]) != nil &&
G1[A1(v,w)] != G2[A2(M[v],M[w])] )
Replace
hold for all vertices $x \in V_1 \setminus V$ and $y \in V_2 \setminus
W$.
by
hold for all vertices $x \in V_1$ and $y \in W$ with
$(x,y) \in M$.