Oriented graphs

Task number: 4164

Modify Dijkstra’s algorithm to work for oriented graphs as well.

  • Solution

    In Dijkstra’s algorithm, it is sufficient to consider only out-neighbors \( y \) of the processed vertex \( x \).

Difficulty level: Easy task (using definitions and simple reasoning)
Proving or derivation task
Cs translation
Send comment on task by email