CourseWare Wiki
Switch Term
Summer 2023 / 2024
Winter 2023 / 2024
Summer 2021 / 2022
Winter 2021 / 2022
Summer 2020 / 2021
Winter 2020 / 2021
Summer 2019 / 2020
Winter 2019 / 2020
Summer 2018 / 2019
Winter 2018 / 2019
Summer 2017 / 2018
Search
Log In
b232
courses
a4b36acm1
2013_zs
seminar_08
Differences
This shows you the differences between two versions of the page.
View differences:
Side by Side
Inline
Go
Link to this comparison view
Go
Go
courses:a4b36acm1:2013_zs:seminar_08 [2018/10/03 03:51]
courses:a4b36acm1:2013_zs:seminar_08 [2018/10/03 03:51]
(current)
Line 1:
Line 1:
+
==== Grafy: Přehledy, opakování, pseuodokódy ===
+
== Základem grafových algoritmů je BFS/DFS ==
+
http://kam.mff.cuni.cz/~kuba/ka/pruchod.pdf\\
+
http://ksp.mff.cuni.cz/study/cooks/cookbook-chapters/05-grafy.pdf\\
+
+
== Z BFS/DFS se odvíjí topologické uspořádání a Dijkstrův algoritmus ==
+
http://ksp.mff.cuni.cz/study/cooks/cookbook-chapters/05-grafy.pdf\\
+
http://kam.mff.cuni.cz/~kuba/ka/pruchod.pdf\\
+
http://kam.mff.cuni.cz/~kuba/ka/min_cesta.pdf\\
+
+
== Úloha nejkratších cest se řešívá také pomocí Floyd-Warshallova nebo Bellman-Fordova algoritmu ==
+
http://kam.mff.cuni.cz/~kuba/ka/min_cesta.pdf
+
+
== Maximální tok v síti v případě Ford-Fulkersonova algoritmu je jen opakovanou aplikací BFS/DFS a použijeme jej take pro nalezení maximálního párování ==
+
http://ksp.mff.cuni.cz/study/cooks/cookbook-chapters/15-toky-v-sitich.pdf\\
+
http://kam.mff.cuni.cz/~kuba/ka/toky.pdf\\
+
+
== Téměř samovysvětlující kód pro maximální tok ==
+
http://www.aduni.org/courses/algorithms/courseware/handouts/Reciation_09.html\\
+
+
== Stable Marriages ==
+
[[http://mathsite.math.berkeley.edu/smp/smp.html|Stable marriage]]\\
+
+
== Maďarský algoritmus ==
+
[[http://en.wikipedia.org/wiki/Hungarian_algorithm#Matrix_interpretation|Popis je tady]].\\
+
Pomohou příklady:\\
+
[[http://s-mat-pcs.oulu.fi/~mpa/matreng/eem1_2-1.htm |Ukázka 1]],
+
[[http://www.wikihow.com/Use-the-Hungarian-Algorithm| ukázka 2]].\\
+
+
+
+
=== Úlohy pro seminář 14.11. 2013 ===
+
* [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=152&page=show_problem&problem=1867|How Many Dependencies?]]\\
+
* [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=154&page=show_problem&problem=2021|Place the Guards]]\\
+
* [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=160&page=show_problem&problem=1338|Connect the Campus]]\\
+
* [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=164&page=show_problem&problem=1742|Lift Hopping]]\\
+
* [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=165&page=show_problem&problem=499|Wormholes]]\\
+
* [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=168&page=show_problem&problem=485|Heavy Cargo]]\\
+
* [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=171&page=show_problem&problem=1720|Collector's Problem]]\\
+
* [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=175&page=show_problem&problem=640|The Falling Leaves]]\\
+
* [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=175&page=show_problem&problem=556|Is It A Tree?]]\\
+
* [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=182&page=show_problem&problem=867|Walking Around Wisely]]\\
+
* [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=185&page=show_problem&problem=1021|Gopher II]]\\
+
* [[http://www.spoj.com/problems/MTOTALF/|Total Flow]]\\
+
* [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=15&page=show_problem&problem=1290|Antenna Placement]]\\
+
* [[http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=18&page=show_problem&problem=1556|Rooks]]\\
courses/a4b36acm1/2013_zs/seminar_08.txt
· Last modified: 2018/10/03 03:51 (external edit)