08: Algorithmen II, Vorlesung und Übung, WS 2018/19, 06.11.2018
Author
Peter Sanders, Sebastian Lamm, Demian Hespe
Editor
Participating institute
Institut für Theoretische Informatik (ITI)
Genre
Description
- 0:00:00 Start
- 0:00:05 Augmenting Paths
- 0:01:56 Ford Fulkerson Algorithm
- 0:07:57 Some Basic Observations
- 0:14:57 Blocking Flows
- 0:16:44 Suche in Graphen
- 0:20:19 Dijkstras Algorithmus
- 0:28:30 A*-Suche
- 0:31:31 A*-Suche – Potentialfunktionen
- 0:37:23 A*-Suche – Landmarken
- 0:47:01 Starke Zusammenhangskomponenten
- 1:00:07 Floyd Warshall: SCC als Speedup Technik
Duration (hh:mm:ss)
01:07:18
Series
Algorithmen II, Vorlesung, WS 2018/19
Published on
08.11.2018
Subject area
License
| Resolution | 1280 x 720 Pixel |
| Aspect ratio | 16:9 |
| Audio bitrate | 128000 bps |
| Audio channels | 2 |
| Audio Codec | aac |
| Audio Sample Rate | 48000 Hz |
| Total Bitrate | 935418 bps |
| Color Space | yuv420p |
| Container | mov,mp4,m4a,3gp,3g2,mj2 |
| Media Type | video/mp4 |
| Duration | 4038 s |
| Filename | DIVA-2018-813_hd.mp4 |
| File Size | 472.195.176 byte |
| Frame Rate | 25 |
| Video Bitrate | 801322 bps |
| Video Codec | h264 |
Media URL
Embed Code
Algorithmen II, Vorlesung, WS 2018/19
Episodes 1-30
of 30
