Description: Implemented BFS, DFS and A* To compile this project, use the following command: g++-O search main.cppThen you can run it:./SearchThe input is loaded from a input file in.txtHere is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm.Then there is an integer h indicate the number of heuristic.The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
- [BFSandDFS] - written in C source is a function respec
- [graghty1_bondy] - gragh good theory Internals, from bondy.
- [2615DFS] - zoj 2615 code, DFS english. Because a la
- [CpulspulsLectureNotes2] - Easily learn C++ Programming skills- Jin
- [tsp] - Using branch and bound method for solvin
- [C] - This document, including the capacity C
- [graph] - Map of the basic training algorithm 1 an
- [Five_chess] - C# programming using the man-machine war
- [DFS] - Depth-first search (DFS) is an algorithm
File list (Check if you may need any files):
Download