Here - Combinatorial algorithms and algorithmic graph theory

10 Introduction
Figure 1.4: A graph which can be obtained from multiple parents.
Algorithm 1.1 Construct(graph G)
if G has the desired number of vertices then
output G
else
find expansions
compute classes of equivalent expansions
for each equivalence class do
choose one expansion X
perform expansion X
if expansion is canonical then
Construct(expanded graph)
end if
perform reduction X −1
end for
end if