{"id":20802148,"url":"https://github.com/megave/dsa-3-tasks","last_synced_at":"2025-10-07T00:36:45.922Z","repository":{"id":169588601,"uuid":"645586092","full_name":"megaVE/dsa-3-tasks","owner":"megaVE","description":"My solution for the proposed tasks from the Data Structures and Algorithms III discipline, during the 3rd period of the course | Resolução minha dos trabalhos propostos durante a disciplina de Algoritmos e Estruturas de Dados III no 3º Período do curso","archived":false,"fork":false,"pushed_at":"2023-09-26T13:21:04.000Z","size":943,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-18T12:34:43.466Z","etag":null,"topics":["graph-algorithms","heuristic-algorithm"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/megaVE.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2023-05-26T01:47:08.000Z","updated_at":"2023-09-19T23:26:02.000Z","dependencies_parsed_at":null,"dependency_job_id":"e9f746dd-a7aa-4f64-a267-5bf4c0ba9a13","html_url":"https://github.com/megaVE/dsa-3-tasks","commit_stats":null,"previous_names":["megave/trabalhos-aeds-iii","megave/dsa-3-tasks"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/megaVE%2Fdsa-3-tasks","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/megaVE%2Fdsa-3-tasks/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/megaVE%2Fdsa-3-tasks/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/megaVE%2Fdsa-3-tasks/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/megaVE","download_url":"https://codeload.github.com/megaVE/dsa-3-tasks/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243147270,"owners_count":20243745,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["graph-algorithms","heuristic-algorithm"],"created_at":"2024-11-17T18:28:28.259Z","updated_at":"2025-10-07T00:36:45.913Z","avatar_url":"https://github.com/megaVE.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# DSA 3 Tasks (Trabalhos de AEDS III)\nMy solution for the proposed tasks from the Data Structures and Algorithms III discipline, during the 3rd period of the course | Resolução minha dos trabalhos propostos durante a disciplina de Algoritmos e Estruturas de Dados III no 3º Período do curso \n\n## 1 - Task 1 (Atividade 1)\n\nDevelopment of a C++ script which reads a graph and calculates it's Minimal Tree.\n\n(Desenvolvimento de um script em C++ para ler um grafo e encontrar sua Árvore Mínima.)\n\n## 2 - Task 2 (Atividade 2)\n\nDevelopment of a C++ script which calculates the distance between each pair of vertices of a non-complete graph, using Floyd-Warshall's Algorythm.\n\n(Desenvolvimento de um script em C++ para calcular a distância entre cada par de vértices de um grafo não-completo com o Algoritmo Floyd-Warshall.)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmegave%2Fdsa-3-tasks","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmegave%2Fdsa-3-tasks","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmegave%2Fdsa-3-tasks/lists"}