搜索资源列表
fortune.rar
- fortune扫描线算法生成voronoi图的演示代码，可以动态观察算法运行，对原理的理解有很大的帮助！ ,This routing briefly describes what a Voronoi diagram is and provides an interactive demonstration of how these can be created using Fortune s plain-sweep algorithm.
dijkstra
- Dijkstra Algorithm - a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing.
91805v00_WordRecognition_final
- Developing an Isolated Word Recognition System in MATLAB. Speech-recognition technology is embedded in voice-activated routing systems at customer call centres, voice dialling on mobile phones, and many other everyday applications. A robust s
The-ant-colony-algorithm
- 蚁群算法，解决了旅行商问题的最短路径，优化了路径问题-Ant colony algorithm to solve the traveling salesman problem shortest path to optimize the routing problem
antsolve
- 蚁群算法是对自然界蚂蚁的寻径方式进行模似而得出的 一种仿生算法。蚂蚁在运动过程中，能够在它所经过的路 径上留下一种称之为外激素(pheromone)的物质进行信息 传递，而且蚂蚁在运动过程中能够感知这种物质，并以此 指导自己的运动方向，因此由大量蚂蚁组成的蚁群集体行 为便表现出一种信息正反馈现象：某一路径上走过的蚂蚁 越多，则后来者选择该路径的概率就越大。在该算法中, 可行解经过多次迭代后, 最终将以最大的概率逼近问题的最 优解。 -Ant colony a
Dijkstra-Algorithms-network-root
- Routing protocols use routing algorithms dijkstra algorithm for network routing
implementation
- 自动寻路A*算法的Python实现， A*算法，A*（A-Star)算法是一种静态路网中求解最短路径最有效的直接搜索方法，也是解决许多搜索问题的有效算法。算法中的距离估算值与实际值越接近，最终搜索速度越快。(Python implementation of automatic routing A* algorithm)