搜索资源列表
Qt-Sokoban
- Qt版的推箱子，有所有主要功能，键盘，鼠标，退步，玄关，自动寻路（最短路径）-Qt version of the Sokoban, all key, keyboard, mouse, backward, vestibule, automatically find its way (shortest path)
Graph_Algorithm-1.0.tar
- 算法中图算法的详细实现，包括图的表示，MST,单源最短，所有最短路径算法的c＋＋实现，在linux环境下面编程。-Algorithm in detail algorithm to achieve, including the map that, MST, single-source shortest, all the shortest path algorithm c realization of the following programming in linux environmen
l-grafi
- Floyd-wharshall algoritm for the shortest path problem. I wrote this in C. It s easy to compile and work in all *nix like systems.-Floyd-wharshall algoritm for the shortest path problem. I wrote this in C. It s easy to compile and work in all*nix lik
all_source
- code for all source shortest path
spr
- shortest path routing
route
- 用于计算最短路径的，用C语言写的，大家可以参考-Used to calculate the shortest path, using C language to write, you can refer to
Dijkstra
- 最短路径问题,迪杰斯特拉算法,图像,读取数据,linux-The shortest path problem, Dijkstra algorithm
WordLadder
- 实现一个功能，寻找两个单词之间的最短路径。每次操作变换一个字母。-Implement a function to find the shortest path between two words. Each operation transforms a letter.
findpath
- 路径查找使用一个队列 1。为了给你实施的队列抽象数据类型（ADT）使用acircular阵列的经验。 2。为了解决一个真正的问题，使用队列。 您将首先执行一个模板队列ADT采用圆形阵列。然后，您将使用 队列找到一条最短路径的三维网格来构建应用程序。-Path Finding Using a Queue 1. To give you experience in implementing a queue abstract data type (ADT) using acircular
dtw
- 这个算法是基于动态规划（DP）的思想，解决了发音长短不一的模板匹配问题，简单来说，就是通过构建一个邻接矩阵，寻找最短路径和。-This algorithm is based on the idea of dynamic programming (DP) to solve the problem of template matching pronunciation of varying lengths, in simple terms, is by building a
Program1WireRourtingFall2014
- WireRourting布线程序 给定一个矩阵，里面有1和0,0代表可通过，1代表不可通过，给定一个start position，要求找到target position的最短路径-WireRourting A common approach to the wire routing problem for electrical circuits is to impose a grid over the wire routing region. The grid divides the
9gpt
- 相信大家都玩过九宫拼图游戏，此程序可以找出拼完全图的最短路径。-Believe everyone played jiugong puzzle game, the program can find the shortest path of the complete graph.