Is it possible to create a LocationIndex for a graph with no edges, only nodes?
LocationIndexTree assumes all nodes are connected by edges.
What I need is a way to get all points within a bbox.
I thought about LocationIndexTree because it can store its quadtree in a file.
Do you have any suggestions? I’m not afraid of modifying existing classes if anyone can guide me a little.
Suggestions out of graphhopper would great as well.