Question $3)$ Maze $(30\%)$

You are going to design a maze program. It loads a maze from a maze text file then program walks through the maze and finds the path from starting vertex to the exiting vertex.

Maze text file format:

Number of edges, Number of columns, number of rows $($Header of maze$)$

Vertex$$s name, x position, y position, next linked vertex$$s name, next linked vertex$$s name

$...$

Vertex$$s name, x position, y position, next linked vertex$$s name, next linked vertex$$s name

Example:

$22,7,6$

START,$0,2,$B$,$A

B$,1,2,$C$,$K

C$,1,3,$D$,$E

$...$

V$,4,1,$N$,$A

EXIT,$6,2,$A$,$A

$$A$$ is the same as null. It means not next linked vertex on this path $($this path has no exit$).$

$$W$$ links to exit.

Your task is to write a program. The program does:

$$ Loads a maze txt files $($there are two txt files$)(3\%)$

$$ Draws a maze on the panel $($You are going to decide how to label the nodes$).(3\%)$

$$ Walk through the maze and find path from start to exit. $(5\%)$ You need to show an animation of how your program finds a path from start to exit. $(3\%)$

$$ Highlight the path from start to exit and display the path on the panel. $(3\%)$

$$ nodes$$ names of the path are displayed in order from $$Start$$ to $$Exit$.(5\%)$

$$ make sure your program works for both txt files. $(7\%)$ GUI is provided. $(1\%)$ A jar file is created.