Implemented BFS, DFS and A*
To compile this project, use the following command:
g++ -o search main.cpp
Then you can run it:
./search
The input is loaded from a input file in.txt
Here 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.
Ma tla b 是當今使用最為廣泛的數學軟件，它具有相當強大的數值計算、數據處理、系統
分析、圖形顯示、甚至符號運算功能，是一個完整的數學平臺，但是它不能實現端口操作和
實時控制Borland C + +Builder是一種新穎的可視化編程語言，可方便實現交互界面、數據
采集和端口操作等，但是它在數值處理分析和算法工具等方面，效率遠遠低于Matlab語言
BNB20 Finds the constrained minimum of a function of several possibly integer variables.
％ Usage: [errmsg,Z,X,t,c,fail] =
％ BNB20(fun,x0,xstatus,xlb,xub,A,B,Aeq,Beq,nonlcon,settings,options,P1,P2,...)
％
％ BNB solves problems of the form:
％ Minimize F(x) subject to: xlb <= x0 <=xub
％ A*x <= B Aeq*x=Beq
％ C(x)<=0 Ceq(x)=0
％ x(i) is continuous for xstatus(i)=0
％ x(i) integer for xstatus(i)= 1
％ x(i) fixed for xstatus(i)=2
％
