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)
I have a need, wherein there are multiple nodes spread across. All I know is the location of each nodes. How do I find the best path from all nodes to a particular node?
Can I use the "Dijkstra's Shortest Path Algorithm"? Believe, its YES.
I am not sure, as how do I populate the variable, “segments” in program.
Appreciate an earlier response on this. Would be great, if you could give a code snippet as well.
13 May 2014
Concatenate/merge structures (v4.0, dec 2013).