Reimplement paper Predictive Tree: An Efficient Index for Predictive Queries On Road Networks.
The structure is following:
Predictive-tree construction algorithm is following:
Predictive-tree maintenance algorithm is following:
Get data, road network graph G(N,E,W), where N is the set of nodes, E is the set of edges, and W is the edge weights.
N and E can directly obtain from OSM, how about W ?