Am looking for information regarding Dijkstra's and Bellman-Ford routing Algorithms. Info will be applied towards a relatively short research paper regarding a discussion of both and compare/contrast the two. Info re. Dijkstra's is fairly prolific, though concise, succinct info is not. Bellman-Ford info is not so common. References/technical papers, internet sources all would be helpful.