Project for INF567: Wireless Networks
Data dissemination in connected vehicle scenarios
INF 421 project
This repository contains the INF583 project files for Guillaume Houry and Gabriel Govignon.
autoparallel, using tools of jdt and based on the previous work
Solving the problem of finding a minimal partition of a geometric graph into plane subgraphs. Problem given at the Fourth Computational Geometry Challenge, as part of CG Week in Berlin.
Création d'un labyrinthe en Java via Union-Find