Several basic graph algorithms are widely known from the 1950s–1960s. Although those algorithms have being massively taught at all CS departments all over the world since then, it turns out that new aspects of them can still be revealed. We present two such results on shortest paths algorithms: a new, combined algorithm and a new correctness proof for building the shortest paths tree.