The main focus of this project is to implement a system capable of managing travel groups, using graphs to compute the best routes.
This project uses cmake. Assuming it's installed and properly setup, simply run:
cmake -S . -B build
in this project's directory to generate the build system.- To build the project's documentation, run
cmake --build build --target documentacao
. - To build the project's executable, run
cmake --build build --config Release --target travel
.- The executable can be found under the
build/codigo/
directory, with the nametravel
.
- The executable can be found under the
Warning: Execute these commands on the root of the repository (where the codigo, documentacao, input and apresentacao folders are located at)!
Simply run the executable generated in the last section.
By default, the flow results are sorted, but, if you don't want them sorted, you can use the --no-sort
option.
Example: travel --no-sort
- Name: Desenho de Algoritmos (Algorithm Design)
- Date: Year 2, Semester 2, 2021/22
- More info
This repository is for archival and educational purposes only.
If you don't understand some part of the code or anything else in this repo, feel free to ask (although we may not understand it anymore).
Keep in mind that this repo is public. If you copy any code and use it in your school projects you may be flagged for plagiarism by automated tools.