A Robust Graph Theoretic Solution of Routing in Intelligent Networks

Figure 1

Explaining the process of the algorithm for simplification weights and other details are skipped: (a) initialization: (b) source and destination explored their neighbors; (c) neighbors of neighbors of source and destinations are explored one by one; (d) neighbors of neighbors of source and destinations are explored one by one.

(a)

(b)

(c)

(d)