{"id":16705482,"url":"https://github.com/storopoli/graphs-complexity","last_synced_at":"2026-02-07T20:03:25.388Z","repository":{"id":251036821,"uuid":"833652631","full_name":"storopoli/graphs-complexity","owner":"storopoli","description":"Graph Theory and Computational Complexity","archived":false,"fork":false,"pushed_at":"2025-12-15T08:33:08.000Z","size":1733,"stargazers_count":22,"open_issues_count":0,"forks_count":1,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-12-18T06:51:21.803Z","etag":null,"topics":["algorithms","c","complexity","typst","zig"],"latest_commit_sha":null,"homepage":"","language":"Typst","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"cc0-1.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/storopoli.png","metadata":{"files":{"readme":"README-pt.md","changelog":"CHANGELOG.md","contributing":null,"funding":".github/FUNDING.yml","license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":".github/CODEOWNERS","security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null},"funding":{"github":"storopoli"}},"created_at":"2024-07-25T13:30:22.000Z","updated_at":"2025-12-15T08:33:11.000Z","dependencies_parsed_at":null,"dependency_job_id":"1b59e1d4-333d-4583-8a78-552b6b74b5a8","html_url":"https://github.com/storopoli/graphs-complexity","commit_stats":null,"previous_names":["storopoli/grafos-complexidade","storopoli/graphs-complexity"],"tags_count":30,"template":false,"template_full_name":null,"purl":"pkg:github/storopoli/graphs-complexity","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/storopoli%2Fgraphs-complexity","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/storopoli%2Fgraphs-complexity/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/storopoli%2Fgraphs-complexity/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/storopoli%2Fgraphs-complexity/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/storopoli","download_url":"https://codeload.github.com/storopoli/graphs-complexity/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/storopoli%2Fgraphs-complexity/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29206838,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-07T17:44:10.191Z","status":"ssl_error","status_checked_at":"2026-02-07T17:44:07.936Z","response_time":63,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","c","complexity","typst","zig"],"created_at":"2024-10-12T19:30:16.905Z","updated_at":"2026-02-07T20:03:25.376Z","avatar_url":"https://github.com/storopoli.png","language":"Typst","readme":"# Teoria dos Grafos e Complexidade Computacional\n\n[![CC0](https://img.shields.io/badge/License-CC0-lightgrey.svg)](https://creativecommons.org/publicdomain/zero/1.0/)\n[![C code](https://img.shields.io/badge/code-C-blue)](./code/c)\n[![Haskell code](https://img.shields.io/badge/code-Haskell-purple)](./code/haskell)\n[![Zig code](https://img.shields.io/badge/code-Zig-orange)](./code/zig)\n[![Rodar no Repl.it](https://repl.it/badge/github/storopoli/grafos-complexidade)](https://repl.it/github/storopoli/grafos-complexidade)\n[![Abrir no Gitpod](https://gitpod.io/button/open-in-gitpod.svg)](https://gitpod.io/#https://github.com/storopoli/grafos-complexidade)\n\n\u003e [!NOTE]\n\u003e\n\u003e For English version, please check the [README.md](README.md) file.\n\u003e\n\u003e Para a versão em inglês, por favor, confira o [README.md](README.md).\n\n\u003c!-- markdownlint-disable no-inline-html --\u003e\n\u003cdiv class=\"figure\" style=\"text-align: center\"\u003e\n  \u003cimg src=\"slides/images/algorithm_analysis_meme.jpg\"\n   alt=\"Algorithm meme\" width=\"500\" /\u003e\n\u003c/div\u003e\n\u003c!-- markdownlint-enable no-inline-html --\u003e\n\n## Conteúdo\n\n1. Por que estudar Teoria dos Grafos e Complexidade Computacional?;\n1. Grafos, Caminhos e Ciclos;\n1. Árvores;\n1. Complexidade Computacional;\n1. Problemas P, NP-Completo, e NP-Difícil.\n1. Análise de Algoritmos;\n1. Algoritmos de Busca e Ordenação;\n1. Recursividade;\n1. Divisão e Conquista;\n1. Programação Dinâmica; e\n1. Algoritmos Gulosos.\n\n## Exemplos de Código\n\nA principal linguagem de programação usada para os exemplos é C.\nTambém há exemplos em [Haskell](https://www.haskell.org)\ne em [Zig](https://ziglang.org).\nConfira-os nos diretórios `code/c/`, `code/haskell`, e `code/zig/`, respectivamente.\n\n## Dependências\n\n- Compilador C/C++;\n- (Opcional) [compilador GHC para Haskell](https://www.haskell.org/ghc/);\n- (Opcional) [compilador Zig](https://ziglang.org); e\n- [`typst`](https://typst.app) para os slides.\n\nOs slides são gerados usando [Typst](https://typst.app) com GitHub Actions\ne podem ser encontrados na\n[versão `latest`](https://github.com/storopoli/graphs-complexity/releases/latest/download/slides-pt.pdf).\n\n## Licença\n\nEste conteúdo é licenciado sob uma\n[Creative Commons Public Domain CC0 1.0 License](https://creativecommons.org/publicdomain/zero/1.0/).\n\n[![CC0](https://licensebuttons.net/l/zero/1.0/88x31.png)](https://creativecommons.org/publicdomain/zero/1.0/)\n","funding_links":["https://github.com/sponsors/storopoli"],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstoropoli%2Fgraphs-complexity","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fstoropoli%2Fgraphs-complexity","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstoropoli%2Fgraphs-complexity/lists"}