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.
标签： Implemented following compile command
上传时间： 2014-01-01
上传用户：lhc9102
Securing Apache 2: Step-by-Step When choosing a web server, Apache very often wins against its competitors because of stability, performance, that fact that it s open source, and many other advantages. But when deciding on which version of Apache to use, the choice is not always so simple. On the one hand There is a very popular, stable version used by millions of users, version 1.3, and on the other hand, There is an enhanced and re-designed version 2.0.
标签： Apache Step-by-Step Securing choosing
上传时间： 2015-09-06
上传用户：gundamwzc
A fast lexical analyser generator. It is a tool for generating programs that perform pattern-matching on text. There are many applications for Flex, including writing compilers in conjunction with GNU Bison
标签： pattern-matchin generating generator analyser
上传时间： 2013-12-15
上传用户：aig85
This folder contains all the codes based on Matlab Language for the book <《Iterative Methods for Linear and Nonlinear Equations》, and There are totally 21 M files, which can solve most of linear and nonlinear equations problems.
标签： Iterative the for Language
上传时间： 2013-12-23
上传用户：cazjing
megahal is the conversation simulators conversing with a user in natural language. The program will exploit the fact that human beings tend to read much more meaning into what is said than is actually There MegaHAL differs from conversation simulators such as ELIZA in that it uses a Markov Model to learn how to hold a conversation. It is possible to teach MegaHAL to talk about new topics, and in different languages.
标签： conversation conversing simulators language
上传时间： 2015-10-09
上传用户：lnnn30
Input The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. The first line of each case contains N, and the second line contains N integers giving the time for each people to cross the river. Each case is preceded by a blank line. There won t be more than 1000 people and nobody takes more than 100 seconds to cross. Output For each test case, print a line containing the total number of seconds required for all the N people to cross the river. Sample Input 1 4 1 2 5 10 Sample Output 17
标签： the contains integer number
上传时间： 2015-10-27
上传用户：plsee
Input The input contains blocks of 2 lines. The first line contains the number of sticks parts after cutting, There are at most 64 sticks. The second line contains the lengths of those parts separated by the space. The last line of the file contains zero. Output The output should contains the smallest possible length of original sticks, one per line. Sample Input 9 5 2 1 5 2 1 5 2 1 4 1 2 3 4 0 Sample Output 6 5
标签： contains The blocks number
上传时间： 2015-10-27
上传用户：lepoke
Input The input consists of two lines. The first line contains two integers n and k which are the lengths of the array and the sliding window. There are n integers in the second line. Output There are two lines in the output. The first line gives the minimum values in the window at each position, from left to right, respectively. The second line gives the maximum values. Sample Input 8 3 1 3 -1 -3 5 3 6 7 Sample Output -1 -3 -3 -3 3 3 3 3 5 5 6 7
上传时间： 2014-12-21
上传用户：hongmo
[输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。 #include<stdio.h> int number //队列类型 typedef struct{ int q[20]
标签： 输入
上传时间： 2015-11-16
上传用户：ma1301115706
EDB (Evan s Debugger) is a QT4 based binary mode debugger with the goal of having usability on par with OllyDbg. It uses a plugin architecture, so adding new features can be done with ease. The current release is for Linux, but future releases will target more platforms. Release focus: Major feature enhancements Changes: A new disassembly engine. A bug that could cause crashing was fixed. There is a new flags breakdown in the register view, an environment view plugin, and improved analysis (including a good speed increase). A bug in QT where disabled events could be triggered has been worked around.
标签： usability Debugger debugger binary
上传时间： 2013-12-21
上传用户：gundamwzc
