Creating location index without edges

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.


I’m not sure what exactly you want me to see, I am familiar with this method, but I cannot create a LocationIndexTree becasue my graph does not contain any edges!

I thought you are using this for something outside of GraphHopper and thought pointing you to the sources might help.

This topic was automatically closed 90 days after the last reply. New replies are no longer allowed.