Hi, Attached is a Python function that takes a graph and an incomplete dendrogram and completes the dendrogram by merging the remaining nodes in arbitrary order.
All the best, -- T. On Thursday, 13 February 2014 at 19:21, Daniel Biro wrote: > I am trying to do the same thing that was resolved in this thread: > https://stat.ethz.ch/pipermail/r-help/2012-June/314851.html > in the python package. > > Essentially I am using community_edge_betweenness to obtain the > VertexDendrogram object, but I am working with graphs that have multiple > disconnected components, so the resulting object isn't quite right. How can I > go about altering the resulting object so that the highest level clustering > includes all of the disconnected components. > > Thanks, > Daniel > > > _______________________________________________ > igraph-help mailing list > [email protected] (mailto:[email protected]) > https://lists.nongnu.org/mailman/listinfo/igraph-help
fix_dendrogram.py
Description: Binary data
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
