The inputs for this demo are one or two phylogenetic networks in
eNewick format.
The output is a full description of the networks.
If two networks are given and they have the
same set of leaves, then also the μ-distance between them and an
optimal alignment is obtained. If they do not have the same set of
leaves, then the same computation is done on the topological
restriction to their common leaves.