https://github.com/edumigueis/mars-map-router

Route finder between cities in Mars. The project uses files with informations of Mars's cities to find the best path between them.
https://github.com/edumigueis/mars-map-router

binary-trees data-structures data-structures-and-algorithms maps maps-routing mars-cities route-finder tree

Last synced: about 1 year ago
JSON representation

Route finder between cities in Mars. The project uses files with informations of Mars's cities to find the best path between them.

• Host: GitHub
• URL: https://github.com/edumigueis/mars-map-router
• Owner: edumigueis
• License: gpl-3.0
• Created: 2020-09-29T11:58:52.000Z (over 5 years ago)
• Default Branch: main
• Last Pushed: 2020-10-27T18:54:15.000Z (over 5 years ago)
• Last Synced: 2025-02-01T21:34:29.633Z (about 1 year ago)
• Topics: binary-trees, data-structures, data-structures-and-algorithms, maps, maps-routing, mars-cities, route-finder, tree
• Language: C#
• Homepage:
• Size: 10.4 MB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Mars-Map-Router

> 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.

[![License: GPL v3](https://img.shields.io/badge/License-GPLv3-blue.svg)](https://www.gnu.org/licenses/gpl-3.0)

This 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.

![](header.png)

## Installation

Download the project and run the .exe file. Or, open the project in your prefered .NET Framework IDE and run it there. 

## Usage example

This 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.

## Meta

Copyright (c) Eduardo Migueis and Rodrigo Smith 2020.

Distributed under the GNU GENERAL PUBLIC LICENSE V3 license. See ``LICENSE`` for more information.

[https://github.com/edumigueis/Mars-Map-Router](https://github.com/edumigueis)