This paper explains the two basic algorithms, the Bellman-Ford algorithm and the Dijkstra algorithm, using a simple network example. The paper also provides a comparison of the algorithms, as well as mini-examinations to reinforce the reader’s knowledge.