{"id":21974243,"url":"https://github.com/kaua-pt/amongrun","last_synced_at":"2026-06-22T02:31:33.446Z","repository":{"id":165016927,"uuid":"640401731","full_name":"kaua-pt/AmongRun","owner":"kaua-pt","description":"Um app para speed runs de AmongUs","archived":false,"fork":false,"pushed_at":"2023-08-14T00:09:06.000Z","size":4576,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-09-08T07:42:14.669Z","etag":null,"topics":["among-us","dijkstra-algorithm","flask","python"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/kaua-pt.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-05-14T00:52:43.000Z","updated_at":"2023-08-05T01:39:06.000Z","dependencies_parsed_at":null,"dependency_job_id":"ec52a911-bf96-4ad5-989d-cfd4e0fe69a2","html_url":"https://github.com/kaua-pt/AmongRun","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/kaua-pt/AmongRun","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kaua-pt%2FAmongRun","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kaua-pt%2FAmongRun/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kaua-pt%2FAmongRun/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kaua-pt%2FAmongRun/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kaua-pt","download_url":"https://codeload.github.com/kaua-pt/AmongRun/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kaua-pt%2FAmongRun/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34632521,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-22T02:00:06.391Z","response_time":106,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["among-us","dijkstra-algorithm","flask","python"],"created_at":"2024-11-29T15:40:14.899Z","updated_at":"2026-06-22T02:31:33.426Z","avatar_url":"https://github.com/kaua-pt.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003cdiv align=\"center\"\u003e\n  \u003cimg src=\"https://play-lh.googleusercontent.com/8ddL1kuoNUB5vUvgDVjYY3_6HwQcrg1K2fd_R8soD-e2QYj8fT9cfhfh3G0hnSruLKec\" style=\"width:15vw\"\u003e\u003c/img\u003e\n  \u003ch3 align=\"center\"\u003eAmongRun\u003c/h3\u003e\n\n  \u003cp align=\"center\"\u003e\n    Faça sua speedrun no Among Us! \u003c/br\u003e\n    ✔️ Projeto finalizado ✔️\n  \u003c/p\u003e\n\u003c/div\u003e\n\n\n\u003c!-- ABOUT THE PROJECT --\u003e\n## :earth_americas: Sobre o projeto\n\nEste projeto é feito com o intuito de estudar o framework Flask e o algoritmo de Dijkstra. O projeto utiliza o algoritmo do holandês para otimizar uma rota de tarefas dentro do jogo AmongUs, afim de completar a maior quantidade de tasks no menor tempo\n\n## 💻 Algoritmo de Dijkstra\n\nO algoritmo de Dijkstra encontra o caminho mais curto entre um determinado nó (que é chamado de \"nó de origem\") e todos os outros nós em um grafo. Este algoritmo usa os pesos das arestas para encontrar o caminho que minimiza a distância total (peso) entre o nó de origem e todos os outros nós. (Fonte: [FreeCodeCamp](https://www.freecodecamp.org/portuguese/news/algoritmo-de-caminho-de-custo-minimo-de-dijkstra-uma-introducao-detalhada-e-visual/))\n\n## :hammer: Construído com\n\nO aplicativo é construido com:\u003c/br\u003e\n\n![Tecnologias](https://skillicons.dev/icons?i=python,html,css,flask)\n\n## 💢 Aplicabilidade\nCaso você necessite de um caminho otimizado para a sua partida de Among Us é simples:\n\u003c/br\u003e\n### 1 - Clique no botão:\n![Inicio](/website/static/img/Mainpage.PNG)\n\u003cp\u003eImagem 2: Página principal\u003c/p\u003e\n\n### 2 - Selecione suas tasks e clique no botão novamente:\n\n![Seleção](/website/static/img/Escolha.PNG)\n\n\u003cp\u003eImagem 3: Seleção das tasks\u003c/p\u003e\n\n### 3 - Será dado a sequência de onde você deve ir com o tempo que você irá gastar em segundos:\u003c/br\u003e\n\n![Caminho](/website/static/img/Tela.PNG)\n\n\u003cp\u003eImagem 4: Tela contendo o caminho\u003c/p\u003e\n\n\u003c/br\u003e\n\n## :dash: Licença\n\nDistributed under the MIT License. See `LICENSE.txt` for more information.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkaua-pt%2Famongrun","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkaua-pt%2Famongrun","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkaua-pt%2Famongrun/lists"}