AI Algorithm Implementation: Dijkstra's, A*, BFS, and DFS algorithms

This assignment presents a practical implementation of several core AI algorithms. It covers the Depth First Search (DFS) algorithm, explaining its function and providing a visual representation of its operation. The A* algorithm is implemented for pathfinding, and the Breadth First Search (BFS) algorithm is also included, demonstrating its horizontal traversal approach. The Greedy Best First Search algorithm is implemented to explore the most promising nodes, and the Lowest Cost algorithm (Dijkstra's) is implemented to find the shortest paths. The assignment includes detailed steps for running the programs, from downloading necessary software to running the various algorithms and visualizing the results. The assignment emphasizes the interlinked nature of the algorithms and the use of specific files. It also specifies how to run the lib files in visual studio for the proper running of all the algorithms. The provided screenshots and explanations aid in understanding the practical application of these algorithms in problem-solving scenarios.

Screenshots for Implementation Part
Depth First Search algorithm
One starts at root and then it explores as possible along each and every branch before
backtracking. The squares are made and the algorithm performs accordingly.

A* algorithm
The A* algorithm is implemented and the process of plotting an efficiently focused path
between multiple points in map.
Breadth first algorithm
1. Breadth first search algorithm is implemented and it First move horizontally and
visit all the nodes of the current layer. Move to the next layer

Greedy best first algorithm
The greedy best first algorithm is implemented and the screenshot is provided below. The
operation for greedy best first algorithm is that it explores a graph by expanding the most
promising node chosen according to a specified rule. The graph flow in map for best first
algorithm is provided as a screenshot below,
Lowest Cost algorithm
Lowest cost algorithm is implemented and the screenshot is provided. This lowest cost is
otherwise called Dijkstra’s algorithm. This is for finding the shortest paths between nodes
in a graph, which may represent.

Steps to be followed for running the program.
These are all the common steps followed to run all the algorithms. Kindly Follow the below
steps
Step 1: Download Dev c++
Step 2: Download all the programs present in the zip file, because each and every algorithm is
interlinked with one another.
Step 3: Copy every algorithm in Dev c++ followed by
AStarWalker.cpp,AStarWalker.h,Walker.cpp, Walker.h, Graph.cpp, Graph.h, Graphnode.cpp,
Graphnode.h etc,.
Step 4: After copying the algorithm in Dev c++, run the program to get the output.
Step 5: While running, the input have to be given by the user as
Enter the no. of vertices :
Enter the no. of edges :
Enter the no. of v1 --> v2 :
Step 6: Give the inputs and press enter key. The output is displayed
Step 7: After getting the outputs, copy the files such asBFS.cpp,BFS.h, DFS.cpp,DFS.h,
GreedyBFS.cpp,GreedyBFS.h etc, and run everything to get the output.

Step 8: To run these algorithm, kindly run the lib files in visual studio. After successful running
of these lib files, it is easy to run all the algorithms.