I have a list of machines with longitude and latitude within a city. From a starting point, I need to traverse all the machines with minimum effort.There is no relationship between each machines.
I'm exploring Neo4j to solve this problem. Question:
Option1:
I have tried Neo4j spatial, added a SimplePointLayer to it,
but couldn't find an algorithm to find the best routing.
Is there any way to achieve this with Neo4j Spatial?
Option2:
1. I've seen many examples of putting road data into Neo4j as relationships to the nodes?
How can I load road data from map to my Neo4j?
2. If road data can be loaded to Neo4j,
seems like minimum spanning tree algorithm can solve the problem ?