0
votes
1answer
39 views

What is the right methodology to assign costs to edges of a network?

I am producing a routing facility for cycling safety based on an OSM network. The edges of this network have costs and these are calculated from different criteria both related to intrinsic (as the ...
2
votes
0answers
127 views

Plot the Shortest Paths in a Grid without any clash at a point of time

The efficient algorithm needs to be done and proved for the best solution for the given problem: User inputs: (#) Size of the NxN Grid. (N); (#) No. of Paths: Z; (#) Source and Destination ...
6
votes
3answers
934 views

Find a proper path between two nodes in a grid

This question is about finding a proper path (route) between two nodes (P,Q) in a grid (i.e., graph, network, ...). In our concept, we define a path proper (nice) if it is the most similar* to the ...