This is the final project for Java course INF103 at Telecom ParisTech. At any time, it is strongly not recommended to copy it as your own homework!
Go through one labyrinth, which may be initialized on your preferences, via the shortest path at one click.
French version: Représenter un labyrinthe avec une porte d'entré et une porte de sortie et de trouver le plus court chemin qui va de l'une à l'autre.
Set departure point: Type "D" or "d" on the box pointed by the mouse.
Set arrival point: Type "A" or "a" on the box pointed by the mouse.
Change a box into "wall": Just click on a it!
Change a box into "empty": Just click on a it!
Set a "wall" block: Drag the mouse from up-left corner to down-right corner.
Set an "empty" block: Shift-drag the mouse from up-left corner to down-right corner.
Hope you an enjoyful journey O(∩_∩)O
Any questions or suggestions, please propose new issues, send pull requests or contact directly with the author:
BAO Yukun yukun.bao@telecom-paristech.fr
