Assignment

You need to write a program $($preferably in Java$)$ to do the following:

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

$1-$ Depth First Search

$2-$ Breadth First Search

$3-$ USC

$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....

You need to submit the following:

Driver program to $($TestGraph$.$java$)$:

$1-$ Read a graph of nodes; you can use a text file to read the graph from. You may refer to the way of which graphs were represented in data structure course

$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

The other java files needed to run your program

Note: if you are submitting multiple files, please compress them under the name of: You first name$\_$you last name$\_$You ID

Attachments:

I attached some java files to help you with your assignment

Jubail Industrial College $($JIC$)$

Department of Computer Information and Technology

SEM $452$ CS $470$ Introduction to Artificial Intelligence

Submission:

You are expected to:

Use the graphs from the exercises I posted as the input for your program

show me a demo where you run the algorithms and show the results and explain the implementation

$,$ submit $($the code, screenshot of the results, names of the group members$)$

Notes:

Use the graph version of the algorithm $($in which a node is explored only once$).$

Use alphabetical ordering to resolve any tie.