BE Graphes repository of : LACAU Clément ALNET Paul Implements path findings algorithms through a GPS app.
Find a file
2024-05-26 11:19:02 +02:00
.vscode feat(time-trial): add time trial 2024-05-21 17:25:43 +02:00
be-graphes-algos feat(marathon): display path-finding on gui 2024-05-26 11:19:02 +02:00
be-graphes-gui feat(marathon): display path-finding on gui 2024-05-26 11:19:02 +02:00
be-graphes-model chore(path): restore getArcs immutability 2024-05-25 17:41:46 +02:00
Paths/custom_paths Tests Dijkstra (TIME) and added some paths 2024-05-18 18:29:08 +02:00
.gitignore Added .path and .json 2024-05-21 01:07:46 +02:00
algos.puml
class_diagram.puml
Marathon.md doc(marathon): add path constrains and algo ideas 2024-05-20 21:59:17 +02:00
pom.xml
README.md
Synthese_LACAU_ALNET.docx Update sur la fiche de synthèse 2024-05-25 19:50:03 +02:00

Graph & Algorithm project — INSA Toulouse

Building

The instructions below are an attempt at using java from the command line. These efforts were in vain (~3 man-hours + help from 2 teachers). The "solution" was to use VScode. The instructions are left below for posterity.

Prerequisites

This project makes use of Maven. On a debian-like system, install Maven :

sudo apt-get install maven

Compiling

In the project root directory :

mvn compile

Packaging

In the project root directory :

mvn package

Or skip tests :

mvn package -Dmaven.test.skip=true

The output jar files will be in the <project>/target/ directory of each project.

Testing

In the root directory, start all tests :

mvn test