Algorithm 1.

Pseudo code of the proposed path search algorithm.

Input: the graph with all the subjects and the three variant tem-     plates

Output: path from variant template i to variant template j

Initialization: Spanning tree T = variant template i

While variant template j is not in T.

1. Find the connection C with the highest weight between the nodes     in T and the nodes that are not in T.

2. Grow T with C.

End

Trace the path from the root (variant template i) to variant template   j in spanning tree T.