Bellman-Ford Shortest Path Algorithm

(C) 2004 by Yu Hen Hu

find shortest path from a fixed point U to any node V





clear all

n=input( Total number of nodes = )

echo on

starting from a fixed point U, you enter the weight to each

node as the weight on the edge from U to that node V

if there is no such edge, enter inf

when enter a vector, put all number within brackets [ ]

echo o-Bellman-Ford Shortest Path Algorithm

　(C) 2004 by Yu Hen Hu

　find shortest path from a fixed point U to any node V

　



clear all

　n=input( Total number of nodes　=　)

　echo on

　starting from a fixed point U, you enter the weight to each

　node as the weight on the edge from U to that node V

　if there is no such edge, enter inf

　when enter a vector, put all number within brackets [ ]

　echo off