23: Algorithmen I, Übung, SS 2019, 24.07.2019
Author
Participating institute
Institut für Theoretische Informatik (ITI)
Genre
Description
- 0:00:00 Start
- 0:00:13 Übung: Überblick
- 0:03:26 Dijkstras Algorithmus
- 0:07:19 Bellmann Ford Algorithmus
- 0:14:50 Minimale Spannbäume
- 0:20:31 Steinerbäume
- 0:27:20 Problem des Handlungsreisenden (TSP)
Duration (hh:mm:ss)
00:31:25
Series
Algorithmen I, Vorlesung, SS 2019
Published on
30.07.2019
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 | 934261 bps |
| Color Space | yuv420p |
| Container | mov,mp4,m4a,3gp,3g2,mj2 |
| Media Type | video/mp4 |
| Duration | 1885 s |
| Filename | DIVA-2019-708_hd.mp4 |
| File Size | 220.177.938 byte |
| Frame Rate | 25 |
| Video Bitrate | 800185 bps |
| Video Codec | h264 |
Media URL
Embed Code
Algorithmen I, Vorlesung, SS 2019
Episodes 1-23
of 23
