Does Dijkstra's Algorithm actually check nodes marked as visited?
It depends on the implementation, but generally those edges are considered, but the algorithm immediately notices the target node is already visited or the new distance is greater than the old one, and doesn't process the edge further.