资源列表
1
- 智能小车C程序 可完成某些功能-Smart car C program
Shortest_Path
- 求多源最短路径的一个算法,编码风格清晰明了-Seeking a multi-source shortest path algorithm, coding style, clarity
b
- it is matlab source code implemeted in Matlab 7.6. this is utilized in matlab.
ISODATA
- C++中的ISODATA算法示例，感兴趣的可以参考下。-C++ examples in the ISODATA algorithm, interested can refer to.
algorithms-for-fortran
- 徐士良的fortran常用算法集一书中的源代码，进攻参考学习。-XU Shi-liang' s common set of algorithms fortran source code for the book, the offensive reference to learning.
engineering-fluid-dynamics
- 工程流体力学（英文）一书第四章的源程序，可以结合书进行学习，对入门的人有很大帮助。-Engineering Fluid Mechanics (English) Chapter IV of the source book, the book can be combined to learn, a lot of people started to help.
hannuota
- VC++汉诺塔算法的实现，动态移动图形。-VC++ Tower of Hanoi algorithm, dynamic mobile graphics.
Monte-Carlo-Method-based-Crystal-Growth-Studies-1
- USE OF MONTI CARLO METHOD IN PHYSICS -USE OF MONTI CARLO METHOD IN PHYSICS
dijkstra
- 基于贪吃算法的两点间最短距离的源代码，简单易懂。-Greedy algorithm based on shortest distance between two points of the source code, easy to understand.
QueensLVB
- 用拉斯维加斯算法实现的一个N皇后问题，N皇后问题是一个NP问题，但这个算法计算速度非常快。-Las Vegas algorithm with an N queens problem, N Queens problem is a NP problem, but this algorithm is very fast.
Path-planing
- 输入路网的节点、各对应路段的路阻，起点和终点，然后利用Dijkstra()算法从中找出一条权值最小的路径并输出。-Enter the network node, the corresponding sections of the road resistance, start and end, and then use Dijkstra () method to find out a path with the least weight and output.
zuixiao
- 最小重量机器设计问题，回溯法和分支限定法-#include<iostream> using namespace std #define N 3 #define M 3 int w[N][M]={{1,2,3},{3,2,1},{2,2,2}} int c[N][M]={{1,2,3},{3,2,1},{2,2,2}} class machine {public: