Rank: 207433 based on 0 downloads (last 30 days) and 0 file submitted



Personal Profile:


Watch this Author's files


Comments and Ratings by Puffeltje
Updated File Comments Rating
31 May 2014 Dijkstra's Shortest Path Algorithm calculates the shortest path and distance between two nodes on a map Author: Joseph Kirk

I have a database with nodes en segments but the segments must be calculated before they can be added to the algorithm. I have a query wich calculates all the posible segments from one specific node to other nodes.

Is it possible to calculate the needed segments during the algorithm? In that case i don't have to calculate all the possible segments for the whole database (16,000 nodes with about 2,450,000 segments)


Contact us