Thank you very much, Tamás! I will try your suggestions! All the best,
Charles On Wed, Mar 14, 2012 at 1:46 PM, Tamás Nepusz <[email protected]> wrote: >> I'm trying to draw a graph where the distance between vertices >> correspond to the edge weights. I know it is difficult to do, but I >> ask you if do you know any algorithm that minimizes the problems of >> this kind of plot. It would be so helpful if you could suggest it. > > Multidimensional scaling is the algorithm you are looking for -- but it works > only if you can assign a distance to every pair of vertices, not just the > connected ones. See layout.mds in the R package. If you don't have a distance > for every pair of vertices, you can still approximate the distance matrix by > calculating the total weight of the shortest path between disconnected > vertices. > > Best, > T. > > > _______________________________________________ > igraph-help mailing list > [email protected] > https://lists.nongnu.org/mailman/listinfo/igraph-help -- Um axé! :) -- Charles Novaes de Santana http://www.imedea.uib-csic.es/~charles PhD student - Global Change Laboratorio Internacional de Cambio Global Department of Global Change Research Instituto Mediterráneo de Estudios Avanzados(CSIC/UIB) Calle Miquel Marques 21, 07190 Esporles - Islas Baleares - España Office phone - +34 971 610 896 Cell phone - +34 660 207 940 _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
