Task list filter?
Choose required ranks and required tasks. The table of contents will list only tasks having one of the required ranks in corresponding rankings and at least one of the required tags (overall). If you wish to filter only according to some rankings or tags, leave the other groups empty.
Task rankings
Difficulty level
Task tags
Task type
«
«
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.