Member Avatar for emreesir
emreesir 0 Newbie Poster

Hi, I have a problem that is shortest path problem. I use dijkstra algorithm but query has a time that is an hour on 280.000 node-graph. I have to reduce query time to 1 second.
I try to find these way but I can not found any implementation of these algorithm

Highway hierarchy
Landmarks (ALT)
Arc-Flags
SHARC
Reach

I realy need to know pseudo code or implementation of any one in these algorithm

algorithm of any methodology
1. preprocessing algorithm
2. query algorithm

  • 1 Contributor
  • 0 Replies
  • 49 Views
Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.