20: Minimale Spannbäume: MST-Kanten, Jarník-Prim Algorithmus, Kruskals Algorithmus

Vertiefung der Konzepte zu minimalen Spannbäumen, inklusive MST-Kanten, dem Jarník-Prim Algorithmus sowie Kruskals Algorithmus, mit Wiederholungen aus vorherigen Lektionen und Beispielen zu negativen Kosten und vollständigen Graphen.

KIT Lehre und Wissen387 views01:31:20

About this video

Inhalt: Wiederholung aus Lektion 19 00:07:04 10.6 Negative Kosten 00:32:00 10.7 Von Überall nach Überall 00:39:57 11 Minimale Spannbäume 00:53:04 11.1 MST-Kanten auswählen und verwerfen 00:59:57 11.2 Der Jarník-Prim Algorithmus 01:14:58 11.3 Kruskals Algorithmus 01:21:09 11.4 Union-Find Datenstruktur Dozent: Prof. Dr. Peter Sanders | Karlsruher Institut für Technologie (KIT) | Institut für Theoretische Informatik | https://algo2.iti.kit.edu/index.php Produktion: KIT|WEBCAST: http://webcast.informatik.kit.edu

Tags and Topics

This video is tagged with the following topics. Click any tag to explore more related content and discover similar videos:

Tags help categorize content and make it easier to find related videos. Browse our collection to discover more content in these categories.

Video Information

Views
387

Total views since publication

Duration
01:31:20

Video length

Published
Feb 26, 2015

Release date

Quality
hd

Video definition

Related Trending Topics

LIVE TRENDS

This video may be related to current global trending topics. Click any trend to explore more videos about what's hot right now!

THIS VIDEO IS TRENDING!

This video is currently trending in Thailand under the topic 'mu'.

Share This Video

SOCIAL SHARE

Share this video with your friends and followers across all major social platforms. Help spread the word about great content!