More than one path in a directed graph? -
i want start building app public transport. know should use dijkstra algorithm find shortest path between 2 points.
how can more 1 path? give user @ least 3 or 4 options, not best route. reason want include more variables, time, cost , bus capacity.
is there algorithm me this? or naively thinking should modify dijkstra give me more 1 path.
cheers.
have @ k shortest path routing, generalization of dijkstra.