hill-climbing

数据结构算法集锦：包括大量常用算法，如求两数的最大公约数、素数的求法、Prim算法、Kruskal算法、最短路径、Dijkstra 算法、排序相关算法、高精度计算相关算法(algorithm data structure highlights include : large common algorithms, such as for the number two majors, for the prime numbers, Prim algorithm, Kruskal algorithm, the shortest path, the Dijkstra algorithm, scheduling algorithms, high-precision calculation algorithms, etc.)

A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0) 2、重复以下步骤: 在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点 把当前节点从开放列表删除, 加入到封闭列表. (A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values ​ ​ are regarded as 0) 2, repeat the the following steps: to Find a the has a the the smallest F value of the node in the the and opening up list of, and put Find a to the node as the current node current node is removed from the open list, added to the closed list.)

VC++常用的数据结构类源码 这是我在VC++日常开发中收集的一些经常用到的类库，每一款都可以轻松重用，这些类库适用于vs2003及以上的开发环境，其中 Thread 和 Delegate 是从C#中得到的灵感，还有一些是在使用开源代码或其它语言时得到的启发和灵感。个人认为部分代码还算好用，所以拿来分享一下。部分类库附带有例子，欢迎参考。 (Commonly used data structures in VC++ class source This is the daily development of VC++ I collected some frequently used library, each designed to easily reuse these libraries apply to vs2003 and development environment, including Thread and Delegate inspiration from C#, there are some inspired use of open source code or other languages ​ ​ and inspiration. Personally think that part of the code is fairly easy to use, so used to share. Some class library included with examples for reference.)

一本介绍各种算法的经典书籍，计算机算法设计与分析(A classic book introduces a variety of algorithms, algorithm design and analysis of computer)

　广度优先搜索及深度优先搜索，用C语言实现，比较使用(Breadth-first search and depth first search, using C language, compared with)

使用VC编写的约瑟夫环程序，简单明了，方便使用(Prepared using the VC Joseph Central program, simple and clear, easy to use)

这是一个堆排序的算法源程序，算法被单独写成一个函数，希望对大家有用(This is a heap sort algorithm source code, algorithms are written as a separate function, we hope to be useful)

用C语言实现的普通快速排序，和随机快速排序进行对比(With ordinary C language implementation of quick sort, quick sort and compare the random)

校园导游，可以选择景点序号来了解景点，通过选择两点可计算最短距离和最近路线。(Campus tour guide, you can choose the attractions serial number to understand the attractions of by selecting the shortest distance can be calculated and the recently routes.)

算法设计的动态规划，贪心算法 操作系统的银行家算法等五个小程序(data)