Martin Thoma
de1ad26035
Adjust Python code to follow PEP8
|
9 éve | |
|---|---|---|
| .. | ||
| Material | 9 éve | |
| logos | 12 éve | |
| .gitignore | 12 éve | |
| Artikulationspunkt.tex | 10 éve | |
| Bridge.tex | 10 éve | |
| Eulerkreisproblem.tex | 10 éve | |
| GraphColoring.tex | 10 éve | |
| Graphentheorie-2.tex | 10 éve | |
| Hamiltonkreisproblem.tex | 10 éve | |
| Kreise.tex | 12 éve | |
| KruskalsAlgorithm.tex | 10 éve | |
| Literatur.tex | 10 éve | |
| Makefile | 12 éve | |
| MinimaleSpannbaume.tex | 10 éve | |
| PrimsAlgorithm.tex | 10 éve | |
| Quellen.tex | 10 éve | |
| README.md | 12 éve | |
| SCC-finden.tex | 10 éve | |
| SCC.tex | 12 éve | |
| Zusammenhang.tex | 10 éve | |
| Zweifachverbundener-Graph.tex | 10 éve | |
| fragen.tex | 12 éve | |
| make.bat | 12 éve | |
README.md
Graphalgorithms II
This are the slides for our short presentation about algorithms that operate on graphs. This presentation is in context of 'ICPC' - a hands-on training at the KIT
Work-sharing
- Tobi: Minimal spanning trees
- Martin: SCC (general introduction, how to find scc)
- Max: SCC (biconnected graphs, articulation points, bridges), Coloring
- Thomas: hamiltonian and eulerian circles
Deadlines
- 15.05.2012: draft of the talk
- 24.05.2012: release of the final presentation
- 31.05.2012: the presentation
Compiling this document
- You have to run
maketwice to compile it - If you want the KIT-Style, you should take a look at this Readme