搜索资源列表
最小生成树prim算法
- 最小生成树的prim算法 是求图中的最短路径的一个重要算法 但是是O(n2)复杂度的一个算法-minimum spanning tree algorithm is the prim map for the shortest path algorithm of an important but is O (n2) of a complex algorithm
图的常用算法
- 图的常用算法，比较全面 并有一种求图的最短路径的算法， 欢迎指正，-map commonly used algorithms, a more comprehensive and a map for the shortest path algorithm welcome correction, thank you
int dfsSweep
- 深度搜索算法，求解从起源点s到点j的最短路径算法的基本过程-depth search algorithm, solved from the point of origin j s close of the shortest path algorithm for the basic process
求一个Dijkstra优化算法
- 求解一个最短路径问题程序，可以参考一下求一个Dijkstra优化算法！ 谢谢了 目的是求给定两点之间的最短距离 或者改一下我的程序也行 -shortest path to solve a problem of procedure, can seek a reference Dijkstra algorithm optimization! Thank you, the purpose is scheduled for 2:00 to the shortest distance be
dos下的校园导游图
- 校园导游图，在dos环境实现，用了最短路径算法，可以查询两点的最短路径及长度-campus tour map, dos environment achieved, with the shortest path algorithm can find the shortest path two lengths and
dataS2
- 数据结构综合实验,有各种排序算法和计算排序时间,最短路径算法,huffman编码解码.用图形界面实现.在jbuilder2006下运行通过.-comprehensive experimental data structure, various sorting algorithm and sorting time, the shortest path algorithm, Huffman encoding and decoding. Using a graphical interface to a
最短路径的求解
- 本实验中的问题是一个逻辑问题，而实验的目的是运用邻接矩阵解决图存储并解决在此结构情况下对矩阵中元素的扫描计算。其关键是怎样储存和计算。储存用的是邻接矩阵，而计算是用迪杰斯特拉算法。-experiment of the problem is a problem of logic, and The purpose of this experiment is to use the adjacency matrix storage solutions and plans to solve the st
Bellman-Ford算法
- Bellman-Ford算法 是最短路径算法的一种-Bellman-Ford algorithm is the shortest path algorithm of a
DataStructureUtil
- 该压缩文件夹内有诸多常用算法和数据结构的c++模板编程实现，可作为您程序开发的辅助工具。具体有栈、队列、优先队列、字典、二叉树、图（包括节点的遍历，连通性判断，3种经典最短路径算法的实现等）。-The compressed folder, there are many commonly used algorithms and data structures c++ Template programming, can be used as your development tool. Specif
shortest1
- 这是一个关于最短路径的算法，用于计算点到点之间的最小距离。-This is a study on the shortest path algorithm, used to calculate the minimum distance between point-to-point.
dijkstra
- Dijkstra算法 邻接表向量实现（求最短路径及具体走法） -Dijkstra algorithm to achieve adjacency list vector (for the shortest path and the specific moves)
suanfa
- 里面包含了各种常用算法的java实现，如八皇后问题，合唱队问题，找零钱问题，最短路径问题等-Which contains a variety of commonly used algorithm java implementation, such as the eight queens problem, chorus problems, to find small change problem, the shortest path problem, etc.
TheProgramofDataStructure
- 数据结构实验：包括基本实验代码，霍夫曼书，最短路径，排序算法，计算器，迷宫算法等经典算法的完整代码实现。所有代码均已完成上机实验调试成功。-Experiment data structure: the basic experiment code, Hoffman book, the shortest path, sorting algorithms, calculators, and other classical algorithm maze algorithm to achieve the
Dijkstra
- 简单的实现Dijkstra算法求最短路径，能输几个节点及各个节点的距离，然后算出中心节点与其他节点的最短路径。-Simple implementation Dijkstra algorithm seek shortest path, can lose several node and various node distance then calculated center node with other node shortest path.
TopoOrder_Level
- 单向图的最短路径搜索算法，首先对节点进行拓扑排序，然后实现复杂度为O（m）的最短路径搜索。-Single shortest path graph search algorithm, the first topological sort of nodes, and then implement the complexity of O (m) of the shortest path search.
task3
- 计算最短路径的算法。本实验实现dijkstra算法。图存储采用了数组存储结构。(Dijkstra algorithm, the shortest path algorithm. This experiment implements the Dijkstra algorithm. The array storage structure is used for graph storage)
最小生成树
- 使用MATLAB编写的Kruskral最小生成树算法，可用于求最短路径等。(Using MATLAB Kruskral minimum spanning tree algorithm, can be used to find the shortest path.)
dijkstra
- 求有向图中的一点到任意一点之间的最短路径，用dijkstra算法实现。(The shortest path between one point and any point in the directed graph is realized by the Dijkstra algorithm.)
矩阵调度算法
- 迪杰斯特拉算法，求两点最短路径，可以简单快速得出矩阵内两点之间的最短路径。(Di Jie Si Te La Suan Fa)
dijkstra_i_path
- dijkstra 最短路径算法在铁路路网规划上的简单实现(dijkstra algorithm on railway distribution)