I would like to implement a weighted bipartite graph with similarity clustering of the two subgraphs. A good example is here <https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3605000/figure/F1/>. Each subgraph will be clustered according to a similarity matrix. Edges between the two subgraphs will be weighted. So I far I can implement a layout_fruchterman_reingold layout for a graph based on a distance matrix. Also, I can do a weighted bipartite graph. I am looking for a way to combine the two approaches.
Thanks - Bakary N’tji DIALLO PhD Student (Bioinformatics) <http://linkedin.com/in/bakarydiallo>, Research Unit in Bioinformatics (RUBi) <https://rubi.ru.ac.za/> Mail: [email protected] | Skype: diallobakary4 Tel: +27798233845 | +223 74 56 57 22 | +223 97 39 77 14
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
