added method Graph::Node::minimize_node if the node is redundant (internal node with exactly 2 links) this method will create a new link between the neighbors equal to the combined distance of links from this node to it's 2 neighbors. This node is then unlinked from the graph and possibly released.
added method Graph::Node::minimize_node
if the node is redundant (internal node with exactly 2 links)
this method will create a new link between the neighbors equal to the
combined distance of links from this node to it's 2 neighbors.
This node is then unlinked from the graph and possibly released.

Ensembl/ensembl-compara,danstaines/ensembl-compara,ckongEbi/ensembl-compara,Ensembl/ensembl-compara,kumarsaurabh20/ensembl-compara,danstaines/ensembl-compara,Ensembl/ensembl-compara,Ensembl/ensembl-compara,etapanari/ensembl-compara,kumarsaurabh20/ensembl-compara,etapanari/ensembl-compara,kumarsaurabh20/ensembl-compara,Ensembl/ensembl-compara,danstaines/ensembl-compara,danstaines/ensembl-compara,dbolser-ebi/ensembl-compara,ckongEbi/ensembl-compara,Ensembl/ensembl-compara,Ensembl/ensembl-compara,ckongEbi/ensembl-compara,etapanari/ensembl-compara,dbolser-ebi/ensembl-compara,etapanari/ensembl-compara,dbolser-ebi/ensembl-compara,kumarsaurabh20/ensembl-compara,danstaines/ensembl-compara,Ensembl/ensembl-compara