Package of C library extensions for Windows CE operating system. It is a supplement to C library available on Windows CE platform. The main objective of the project is to provide helper utilities for porting applications from Unix and Windows.
This text introduces the spirit and theory of hacking as well as the science behind it all it also provides some core techniques and tricks of hacking so you can think like a hacker, write your own hacks or thwart potential system attacks.
譯作：《黑客入侵的藝術(shù)》，也是從朋友的寶箱中搜來的，以前層大致瀏覽過，是難得一件的好資料。
With the information in this book, you will learn how to write not only JavaScript that can stand on its own within a Web page, but also how to write scripts that interact with applications written in other development languages.
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.
