搜索资源列表
dijsktra
- C++实现的dijsktra单源最短路径，拓展开对所有节点的最短路径，有利于学习这个算法-C++ achieve dijsktra single source shortest path, expanding open to all nodes of the shortest path, this algorithm is conducive to learning
chartW
- 利用优先级队列求最短路径的算法实现，算法课上的一次作业，水平不高，仅供参考-Use the priority queue for the shortest path algorithm, the algorithm first lesson on the job, the level is not high, for reference
algorithm
- 关于常用的几种算法介绍1、单源最短路径；2、递归与分治；3、贪心算法；4、动态规划；5、回溯法；6、分支限界法-On several commonly used algorithm introduced a single-source shortest path 2, recursion and divide and conquer 3, the greedy algorithm 4, dynamic programming 5, backtracking 6, branch and
danyuanzuiduanlujing
- 自己写的关于单元最短路径的算法实现，也就是迪杰斯特拉算法的实现！-Himself wrote on the unit shortest path algorithm, Dijkstra algorithm is realized!
test
- Floyd算法，数据结构中的图的经典算法，用以计算图中各点的最短路径-Floyd algorithm, the data structure of the classic algorithm to calculate the shortest path graph of each point
123
- 是一种数据结构的编程代码，程序实现一种算法，在铁路系统上在两点间得到最短路径-Programming code is a data structure, a program to implement a method, the rail system in the shortest path between two points
shortestpath
- 迪杰斯特拉算法最短路径，基于vc++mfc平台开发，可供数据结构编程参考-Dijkstra shortest path algorithm, based on vc++mfc platform
question
- 包括了动态计算网络最长最短路线、网络最短路径Dijkstra算法等-Including dynamic computing network longest shortest route network Dijkstra shortest path algorithm
Dijkstra
- 利用dijstra算法求两点间的最 短路径和最短路径条数-Using dijstra Algorithm to get the shortest path between two nodes
main
- 1.掌握图的基本存储方法：邻接矩阵和邻接表（本程序中使用邻接矩阵）； 2.掌握有关图的基本操作算法并能使用高级语言实现（本程序使用C语言）； 3.掌握图的深度优先搜索遍历和广度优先搜索遍历算法； 4.掌握图的最小生成树的两种算法：prim算法和kruskal算法。 5.掌握图的最短路径的两种算法：DIJ算法和floyd算法。 -1 The basic storage methods mastered graph: adjacency matrix and adjacency
simulated-annealing
- 关于模拟退火算法，用于解决最短路径的C语言程序设计，解决了TSP问题-About simulated annealing algorithm, C language program designed for solving the shortest path to solve the TSP problem
tsp
- 关于旅行商问题求解最短路径的程序设计，本程序很好解决TSP问题的算法-About Traveling Salesman Problem solving the shortest path programming, this program is a good algorithm to solve TSP problem
sa
- 本程序是运用模拟退火算法解决旅行商问题，求解最短路径，C语言程序-This procedure is to use simulated annealing algorithm to solve the traveling salesman problem, solving the shortest path, C language program
The-circuit-wiring
- 算法分析与设计电路布线问题,通过二维数组模拟一个电路布线最短路径问题-Algorithm analysis and design of the circuit wiring problem, simulating a circuit wiring through a two-dimensional array of the shortest path problem
path
- 求迷宫的最短路径,设计一个算法找一条从迷宫入口到出口的最短路径。-Find the shortest path maze design an algorithm to find a shortest path from the entrance to the maze exit.
Dijkstra-algorithm
- 对于有向带权图中从一个确定结点到其余各结点的最短路径问题，狄克斯特拉斯提出按路径长度递增顺序逐步产生最短路径的算法构造。- For the weighted graph from one node to determine the shortest path problem the rest of the nodes, Dicks Atlas raised gradually ascending order by the path length of the shortest path al
The-shortest-path
- 用Dijkstra算法和Floyd算法实现最短路径，代码比较详细。-To realize the shortest path
Dijkstra
- 算法作业,迪杰斯特拉算法vs2008+opencv实现,任意构造有向图并计算图上任意两点最短路径及其长度-Arithmetic operations, Dijkstra algorithm using vs2008 and opencv , arbitrary construct a directed graph and calculate the shortest path between any two points on the map and its length
SPFA
- 求单源最短路径的一种算法,是一种高效的最短路算法.-An algorithm for single-source shortest path,which is an efficient algorithm.
Astar
- A*算法求最短路径，数据结构里的图模型。在优化算法方面有很大用途-A* shortest path algorithm，Data structure graph model. Great use in terms of optimization algorithms