Алгоритмы и структуры данных 7. Алгоритмы Флойда и А*

Descripción:

At 0:00 the lecture begins with a recap of the previous lecture. At 7:33 the Floyd algorithm is introduced, followed by memory optimization at 16:00, answer reconstruction at 23:06, and the A* algorithm at 28:49. The lecture continues with definitions of admissible and monotonic heuristics at 40:46, a remark at 43:22, a theorem about the A* algorithm at 44:46, a supporting statement at 50:02, a proof of the theorem at 56:06, and examples at 1:04:00.