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

1. Why study Graph Theory and Computational Complexity?;
2. Graphs, Paths, and Cycles;
3. Trees;
4. Computational Complexity;
5. P, NP-Complete, and NP-Hard Problems.
6. Algorithm Analysis;
7. Search and Sorting Algorithms;
8. Recursion;
9. Divide and Conquer;
10. Dynamic Programming; and
11. Greedy Algorithms.

Code Examples

The primary programming language used for examples is C. Also there are Zig examples. Check them at code/c/ and code/zig/ directories, respectively.

Dependencies

• C/C++ Compiler;
• (Optional) Zig compiler; and
• typst for 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.