Basic_AI_algos

Implementation for shortest path in a grid using BFS, DFS, USC and A-star algorithm

Have implemented the code such that, it will terminate gracefully if the input file is incorrect. Please consider for extra credit.
Have implemented an improved version of manhattan distance, use -IMD to use it. eg. ./CS561A1.exe -Astar -IMD . But it cant be with the other heuristic which will run with -AltH.
Files in zip file are : main.cc, BFS.cc, DFS.cc, UCS.cc, Astar.cc, project1.h, Makefile, CS561A1Written.pdf
Number of Nodes expanded are the number of grid nodes.

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
.DS_Store		.DS_Store
Astar.cc		Astar.cc
Astar.o		Astar.o
BFS.cc		BFS.cc
BFS.o		BFS.o
CS561A1		CS561A1
DFS.cc		DFS.cc
DFS.o		DFS.o
Makefile		Makefile
README.md		README.md
UCS.cc		UCS.cc
UCS.o		UCS.o
input.txt		input.txt
main.cc		main.cc
main.o		main.o
project1.h		project1.h

Provide feedback