22: Algorithmen 2, Vorlesung und Übung, WS 2017/18, 23.01.2018 Algorithmen 2, Vorlesung, WS17/18

22 |
0:00:00 Starten
0:00:09 Algorithms 1956-now
0:00:47 Residual Graph
0:02:25 A Bad Example for Ford Fulkerson
0:03:19 Blocking Flows
0:04:57 Dinitz Algorithm
0:06:11 Blocking Flows Analysis
0:07:39 Dinitz Analysis
0:17:14 Matching
0:20:28 Maximum Cardinality Bipartite Matching
0:23:44 Disadvantage of augmenting paths algorithms
0:45:52 Übung 11
0:46:25 Kürzeste-Wege-Suche
0:48:11 Suche in Graphen
0:51:22 Dijikstras Algorithmus
0:53:19 Bidirectionale Suche
1:00:03 A*-Suche