English version is in beta. All contents of the site should be already translated (mostly using machine translation), and everything should work properly. However, if you find any problems, please contact me.

Level 6B

To advance to the next level, you need to solve all problems.

Dijkstra's algorithm with heap

See the video recordings of lectures SIS.2013.B', section "Dijkstra algorithm for finding shortest paths. Using the heap."

Problems on Dijkstra's algorithm with heap

Backtracking (recursive search)

Theory on recursive backtracking on GeeksForGeeks
Some other theory

A beautiful recursive tree

Problems on backtracking

Floyd and Ford-Bellman algorithms

Floyd 's Algorithm
SIS videos, 2013, B'
SIS videos, 2008, B'
The Forl-Bellman algorithm
SIS videos, 2013, B'
SIS videos, 2008, B'

Problems on Floyd and Ford-Bellman algorithms

algoprog.ru © Petr Kalinin, GNU AGPL, github.com/petr-kalinin/algoprog | About the license for the site materials | Blog (in Russian)