Is it possible to calculate the x,y position of a node in a complete weighted graph with euklidic metric when i have the weight of every edge in the graph? it would be really usefull for me to plot such a graph... i coulnd find any algorithm which can do this :(
Get Point Cloud from Complete Weighted Graph
2
$\begingroup$
algorithms
graph-theory
euclidean-geometry
-
0Is the weight of each edge given by the Euclidean distance between the two vertices on that edge? – 2011-06-15
-
0yes it is... but i have some graphs were it isnt... i think it woulnd work there right? – 2011-06-15