{"id":22479884,"url":"https://github.com/edumigueis/mars-map-router","last_synced_at":"2026-06-10T16:31:31.450Z","repository":{"id":107905362,"uuid":"299602958","full_name":"edumigueis/Mars-Map-Router","owner":"edumigueis","description":"Route finder between cities in Mars. The project uses files with informations of Mars's cities to find the best path between them.","archived":false,"fork":false,"pushed_at":"2020-10-27T18:54:15.000Z","size":10900,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-27T18:33:24.625Z","etag":null,"topics":["binary-trees","data-structures","data-structures-and-algorithms","maps","maps-routing","mars-cities","route-finder","tree"],"latest_commit_sha":null,"homepage":"","language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/edumigueis.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":"2020-09-29T11:58:52.000Z","updated_at":"2020-10-27T18:54:17.000Z","dependencies_parsed_at":null,"dependency_job_id":"ff1e6cab-4473-4631-a2ef-c2e9e551fb2c","html_url":"https://github.com/edumigueis/Mars-Map-Router","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/edumigueis/Mars-Map-Router","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/edumigueis%2FMars-Map-Router","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/edumigueis%2FMars-Map-Router/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/edumigueis%2FMars-Map-Router/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/edumigueis%2FMars-Map-Router/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/edumigueis","download_url":"https://codeload.github.com/edumigueis/Mars-Map-Router/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/edumigueis%2FMars-Map-Router/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34161283,"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-10T02:00:07.152Z","response_time":89,"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":["binary-trees","data-structures","data-structures-and-algorithms","maps","maps-routing","mars-cities","route-finder","tree"],"created_at":"2024-12-06T15:17:48.756Z","updated_at":"2026-06-10T16:31:31.431Z","avatar_url":"https://github.com/edumigueis.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Mars-Map-Router\n\u003e A project for COTUCA's data structures II subject. It was developed in C# and presents a map route finder in Mars. The project uses files with the informations of Mars cities to find the best path between them.\n\n[![License: GPL v3](https://img.shields.io/badge/License-GPLv3-blue.svg)](https://www.gnu.org/licenses/gpl-3.0)\n\nThis project uses file data to put together a web of paths between cities. This information is used to find all paths and the best path between cities. Made using C# and Windows Forms. The main point of the project is the widespread use of different data structures, such as: graph, tree, binary tree, array, stack and multidimensional array.\n\n![](header.png)\n\n## Installation\n\nDownload the project and run the .exe file. Or, open the project in your prefered .NET Framework IDE and run it there. \n\n## Usage example\n\nThis project uses really interesting algorithms like backtracking and recursion in binary trees. This implementations can be used in a lot of situations, especially when dealing with locations and paths overall.\n\n## Meta\n\nCopyright (c) Eduardo Migueis and Rodrigo Smith 2020.\n\nDistributed under the GNU GENERAL PUBLIC LICENSE V3 license. See ``LICENSE`` for more information.\n\n[https://github.com/edumigueis/Mars-Map-Router](https://github.com/edumigueis)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fedumigueis%2Fmars-map-router","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fedumigueis%2Fmars-map-router","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fedumigueis%2Fmars-map-router/lists"}