On the Optimality of Bellman – Ford Shortest Path Algorithm I