algorithm - sliding window for K nearest links search on an adjacent list represented road map -
i doing k nearest links search on road network, represented adjacency list (e.g. adj[1] = {{3,0.5},{8,0.6},{9,1.0}} means node1 connected node 3, 8, 9 , links have weights of 0.5, 0.6, 1.0 respectively.
). want use sliding window when searching point, instead of parsing whole graph, can use sliding window local neighboorhood search inside. however, don't know how window(or more precisely links inside window).
ps: data structure used adjacency list in c++:
struct neighbor{ int id; double weight; }; typedef map<int, vector<neighbor> > adjacency_list;
Comments
Post a Comment