Identification of Optimal Path in Power System Network Using Bellman Ford Algorithm

Table 1

Part of the computed results for shortest path.

Node		Path
From	To	Optimal path	Other available paths
1	10	1→10	1→5→10; 1→5→6→10
2	17	2→7→17	2→5→10→7→17; 2→1→7→17
14	16	14→15→13→10→16	14→15→17→16; 14→15→13→17→16
19	17	19→13→17	19→13→10→7→17; 19→13→10→16→17
18	6	18→17→7→10→6	18→17→16→10→6; 18→17→7→10→5→6