Modify Dijkstra’s algorithm to work for oriented graphs as well.
In Dijkstra’s algorithm, it is sufficient to consider only out-neighbors \( y \) of the processed vertex \( x \).