搜索资源列表
数模计算工具包
- 数学建模中常用的算法，如最短路径ｆｌｏｙｄ算法、蒙特卡洛仿真计算圆周率-mathematical modeling algorithm commonly used, such as the shortest path algorithm Floyd, the Monte Carlo simulation calculation of pi
c_graph_theory
- 最短路径的求取， 利用队列的出入，遍历可行点， 最后找出最短路径-the shortest path to strike, using cohort of access, traverse feasible, find the shortest path final
SchoolGuider
- 校园导游图，包括选择最短路径，选择不同景点，不同参观顺序。-campus tour map, including the choice of the shortest path, choose a different attractions, visited different order.
aglorithm
- 问题算法源代码：骑士遍历、万年历、N皇后问题回溯算法、动态计算网络最长最短路线、货郎担分枝限界图形演示、货郎担限界算法、矩阵乘法动态规划、网络最短路径Dijkstra算法-problems algorithm source code : Knight traversal, calendar, N Queens backtracking algorithms, Dynamic computing network longest shortest routes, traveling salesman
TWO_Q
- Two-Q双端队列最短路算法，平台为Visual C++2005expre-Two-Q double-cohort shortest path algorithm, the platform as Visual C 2005expre
求有向网最短路径
- 求有向网最短路径-are seeking the shortest path to the net
Aver_Path_Length.rar
- 算法，采用Dijk算法，求网络所有点的最短路径和网络的平均最短路径,Algorithm, using Dijk algorithm, and all points of the shortest network path and the average shortest path network
SHORTPATHmatlab
- Dijkstra算法与Floyd算法的matlab实现，以求解最短路问题-Dijkstra algorithm and Floyd algorithm matlab realize in order to solve the shortest path problem
butter
- ACM测试数据，题目甜牛奶，练习单源点最短路径的好题。-ACM test data, the subject of sweet milk, practicing single-source shortest path a good title.
Dijkstra
- Sample program in Java applet demonstarting Dikjstras Algorith(Shortest Path Algorithm).
Dijks-Shor-Path
- 实现了求最短路径的Dijkstra算法，方便操作，可以自已在程序界面上指定每一个点的位置，在界面上空白的地方每点击一下生成一个点-Achieved for the Dijkstra shortest path algorithm to facilitate the operation of their own in the program interface can be specified on the location of each point in the interface areas
dijkstra
- tentang shortest path
shortestpath
- Find a Shortest path using Dijkstra Algorithm in java applet.
floyd_warshall.c
- It is the source code of the Floyd-Warshall algorithm for finding the shortest path between all nodes. The shortest path between two nodes of a graph is a sequence of connected nodes so that the sum of the edges that inter-connect them is minimal
digikstraalg
- This code is used to find the shortest path between two nodes using digikstra s algorithm
nazari-shortest-path
- shortest path in car navigation system
shortest-path
- 这个代码最要是实现最短路径问题，最短路径问题是图论中的一个很重要问题-This code the most if the shortest path problem, shortest path problem is a very important problem in graph theory
Shortest-path-template
- 求最短路径的各种方法模板。包括：dijkstra, BellmanFord, SPFA, Floyed。-Various methods for the shortest path template. Including: dijkstra, BellmanFord, SPFA, Floyed.
shortest-path
- C++ program for Dijkstra s single source shortest path algorithm.The program is for adjacency matrix representation of the graph
The-shortest-path
- 最短路径(单源bellman_ford邻接阵形式)-The shortest path (single source bellman_ford adjacency matrix form)