BE Graphes repository of : LACAU Clément ALNET Paul Implements path findings algorithms through a GPS app.
Find a file
2024-05-19 23:05:42 +02:00
.vscode chore(vscode): add launch profile 2024-03-25 08:45:28 +01:00
be-graphes-algos Adress case: En cas d'égalité, on considèrera en premier le sommet ayant le plus petit coût estimé à la destination. 2024-05-19 23:05:42 +02:00
be-graphes-gui fix(launch): use relative file paths 2024-04-05 08:28:58 +02:00
be-graphes-model chore(path): remove isValid deprecation flag 2024-03-25 10:44:04 +01:00
Paths/custom_paths Tests Dijkstra (TIME) and added some paths 2024-05-18 18:29:08 +02:00
.gitignore Tests Dijkstra (TIME) and added some paths 2024-05-18 18:29:08 +02:00
algos.puml UML algos 2024-04-05 11:08:22 +02:00
class_diagram.puml Diagram class 2024-03-25 10:15:26 +01:00
pom.xml chore(build): set mainClass in main pom.xml 2024-03-25 08:43:51 +01:00
README.md doc(build): add instructions 2024-03-25 08:43:30 +01: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