Fig. 4

Sample run of the hybrid Dijkstra’s algorithm to generate candidate paths. The shortest path between the source and the destination using the traditional Dijkstra’s algorithm is first identified. Then, to provide alternatives to the shortest path, k-shortest paths are computed between the source and destination. These paths are retrieved by excluding individual links of the shortest path. a Sample Topology. b Shortest path. c Shortest path assuming 1-2 is inactive. d Shortest path assuming 2-5 is inactive. e Shortest path assuming 5-7 is inactive