Why not solve the negative dijkstra right side?

Excerpt: https://blog.csdn.net/Kprogram/article/details/81220702

With Dijkstra algorithm, the first step can be obtained the so-called shortest path length of 4, not consider the edge (C, B).
In fact it takes the shortest path was added sides (C, B), the length is 2.