Skip to content
This repository has been archived by the owner on Dec 13, 2024. It is now read-only.

Commit

Permalink
chore: README
Browse files Browse the repository at this point in the history
  • Loading branch information
storopoli committed Jul 31, 2024
1 parent cc29a78 commit b33a77b
Showing 1 changed file with 19 additions and 6 deletions.
25 changes: 19 additions & 6 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -2,17 +2,30 @@

[![CC0](https://img.shields.io/badge/License-CC0-lightgrey.svg)](https://creativecommons.org/publicdomain/zero/1.0/)

## Conteúdo

1. Grafos, Caminhos e Ciclos;
1. Árvores;
1. Emparelhamentos, planaridade e coloração;
1. Complexidade Computacional;
1. Análise de Algoritmos;
1. Algoritmos de Busca e Ordenação;
1. Recursividade;
1. Algortimos Gulosos; e
1. Problemas P, NP-Completo, e NP-Difícil.

## Dependências

- Compilador C/C++
- [`typst`](https://typst.app) para os slides
- Compilador C/C++; e
- [`typst`](https://typst.app) para os slides.

The slides are built using [Typst](https://typst.app) on CI and found at
[`the latest release`](https://github.com/storopoli/cryptography-workshop/releases/latest/download/slides.pdf).
Os slides são gerados usando [Typst](https://typst.app) com GitHub Actions
e podem ser encontrados na
[versão `latest`](https://github.com/storopoli/grafos-complexidade/releases/latest/download/slides.pdf).

## License
## Licença

This content is licensed under a
Este conteúdo é licenciado sob uma
[Creative Commons Public Domain CC0 1.0 License](https://creativecommons.org/publicdomain/zero/1.0/).

[![CC0](https://licensebuttons.net/l/zero/1.0/88x31.png)](https://creativecommons.org/publicdomain/zero/1.0/)

0 comments on commit b33a77b

Please sign in to comment.