Errors in Chapter 13

[pllk]

1. Page 128. Algorithm outputs for nodes 1 -> 4 distance -5 if undirected and 1 if directed. In both cases, Dijkstra correctly finds path 1>3>4 (but with the wrong distance in undirected). The book says it finds path 1>2>4. Am I missing something?
2. Page 123 node "6" should be node "5".

[diffuse]

1. Confirmed that node 4 is relaxed to 1 by the implementation of Dijkstra's algorithm provided in the book. This appears to be an error. A different graph should probably be used as an example here.
2. This is addressed by Minor typo - Fix node number for bellman ford example #90