graphs-complexitystoropoli/graphs-complexity
CC0-1.0N/A
Graph Theory and Computational Complexity
222210
View program on GitHub5
algorithms,c,complexity,typst,zig
README
Graph Theory and Computational Complexity
NOTE
For the Portuguese version, check out the README-pt.md.
Para a versão em português, confira o README-pt.md.
Contents
- Why study Graph Theory and Computational Complexity?;
- Graphs, Paths, and Cycles;
- Trees;
- Computational Complexity;
- P, NP-Complete, and NP-Hard Problems.
- Algorithm Analysis;
- Search and Sorting Algorithms;
- Recursion;
- Divide and Conquer;
- Dynamic Programming; and
- Greedy Algorithms.
Code Examples
The primary programming language used for examples is C.
Also there are Haskell
and Zig examples.
Check them at code/c/, code/haskell, and code/zig/ directories, respectively.
Dependencies
- C/C++ Compiler;
- (Optional) GHC compiler for Haskell;
- (Optional) Zig compiler compiler; and
typstfor the slides.
The slides are generated using Typst with GitHub Actions
and can be found in the
latest version.
License
This content is licensed under a Creative Commons Public Domain CC0 1.0 License.