Algorithms and datastructures I: Lexture 6 (shortest paths and minimum spaning trees)

Přepnout režim kina

Video Player is loading.

Current Time 0:00

Duration 0:00

Loaded: 0%

Stream Type LIVE

Remaining Time 0:00

Jan Hubička

6. přednáška anglické paralelky ADS1 proběhla distančně.

Sdílet

00:01	Recall: shortest paths in valued graphs
04:23	Relaxation algorithm
14:30	Bellman-Ford algorithm
26:07	Floyd-Warshall algorithm
44:05	Minimum spaning trees: Jarník algorithm
1:08:30	Borůvka algorithm
1:19:58	Kruskal algorithm