PLS COMPLETE JAVA CODE

Given a graph of $($nodes and edges$),$ find a path using the following algorithms:

$1-$DFS

$2-$BFS

$3-$UCS

$4-$ GBFS

$5-$A$*$

Use the class Vertex for the graph nodes

Name of the node: use alphabetic to represent the names e$.$g$.,$ A$,$ B etc...:$-$ Driver program to $($TestGraph$.$java$)$:

$1-$ Read a graph of nodes; you can use a text file to read the graph from. $2-$ Ask the user to find a path based on a choice of algorithm to use.

$3-$ The output should be:

a$.$ The path given by the algorithm selected from point #$2$

b$.$ The cost of the path

c$.$ The nodes that are explored on the order they are visited