0

I have got a list of nodes and each node has got a weight. This weight represents the distance from one node to another and it is directed. Is it possible to generate a map similar to a game graph where each of these nodes contains a 2D or 3D position (or maybe a multidimensional)?

Similar to this map: https://i.sstatic.net/ElV6e.png
Or this but including positions: http://www.nature.com/srep/2012/120608/srep00444/images/srep00444-f8.jpg

My data set will be similar to this:

Node   Cost  ConnectsTo
A         1         B, C
B         2         D
C         3         E
D         4         E
E         5

Improve this question
2
  • Try looking here: stackoverflow.com/questions/14327796/… The types of graphs you are asking about are known as Euclidean Graphs. See here for Euclidean MST Commented Apr 4, 2015 at 16:40
  • It's a bit odd that the weight is associated with a vertex and not an edge. An obstruction to representing the graph by Euclidean distances is that there is a cycle that violates the triangle inequality, where one edge is larger than the lengths of the other edges put together. This can be as simple as that the weight of the edge from A to B is not the same as the weight of the opposite edge. Commented Apr 4, 2015 at 18:29
Related questions
2
Is there a proximity map algorithm or data structure?
3
Given distances between n points, how to draw a map from those relationships
2
Build a 2d map if each node only knows distances to a 3 closest nodes
Load 7 more related questions Show fewer related questions

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.