A Robust Graph Theoretic Solution of Routing in Intelligent Networks

Figure 2

(a) Extract one vertex from queue from both sides and explore their neighbors; (b) explore a red vertex; applying case 3, path is calculated and stored; (c) repeat until all vertices change their color to red, and if new path is shorter, then it is stored and old one is skipped. Finally, the shortest path is obtained.