搜索资源列表
Graph
- 有关图的各种重要的操作，有图的邻接矩阵存储，链表存储，关键路径，最短路径，平衡二叉树等-The plan of the various important operation, has the adjacency matrix storage memory list, critical path, shortest path, balanced binary tree, etc.
tudecaozuo
- 有向图,无向图基本操作,包括: 1、邻接矩阵 2、邻接表 3、深度优先遍历 4、广度优先遍历 5、最小生成树 6、拓扑排序 7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-Directed graph, undirected graph, basic operations, including: 1, 2 adjacency matrix, adjacency table 3, 4 depth-first traversal, breadth-f
Dijkstra
- 图与网络论中求最短路径的Dijkstra算法 M-函数 格式 [S,D]=minroute(i,m,W) i为最短路径的起始点,m为图顶点数,W为图的带权邻接矩阵， 不构成边的两顶点之间的权用inf表示。显示结果为：S的每 一列从上到下记录了从始点到终点的最短路径所经顶点的序号； D是一行向量，记录了S中所示路径的大小 -Graph and network theory Dijkstra' s shortest path algorithm M-functio
EfficiencyofNetworks
- 计算网络效率，输入参数，网络的邻接矩阵，输出任意节点对间的效率，及网络效率。 设计思路：floyd算法求最短路径，求倒数，求平均值-Computing network efficiency, input parameters, the network' s adjacency matrix, any node between the output efficiency, and network efficiency. Design ideas: floyd shortest path
shortpath
- 求最短路径，分别用邻接矩阵和邻接表，把路径保存在PATH数组里面。-The shortest path, respectively, with adjacency matrix and adjacency list, the path stored in the PATH array.
shorest-path-sourcecode
- 最短路径算法边权为正值的单源最短路 dijkstra 邻接矩阵 // // author: sunmoonstar_love-shorest path
Visit-system
- 实现功能：1,从文件读入景点信息道路信息，然后用邻接表建立校园图，用邻接矩阵存放边的信息。 2,查看景点信息，道路信息。 3,查找两点之间最短路径，采用弗洛依德算法。 4,采用深度优先递归调用的方法遍利图。-Functions: 1, read from the file into the attractions road information and the establishment of the campus map, and then use the adjacency l
graph
- 这个源代码包含了图的邻接矩阵和链表的两种存储方式、深度和广度的遍历以及prim 和kruskal最短路径两种算法。-The source code contains the adjacency matrix and list two storage mode, the breadth and depth of the traversal and prim And kruskal shortest path of two algorithms.
dijkstraties
- dijkstra输入邻接矩阵，起讫点，输出最短路径-This function is built on the dijkstra.m function written by Jorge
shortestpath
- 用C语言编程实现最短路径算法，打印有向图邻接矩阵。-shortest path
ShortestPath_FLOYD
- 代码的功能：用弗洛伊德算法求每一对顶点之间的最短路径的c语言实现。弗洛伊德算法采用图的带权邻接矩阵存储结构。算法基本思想：假设求顶点Vi到Vj的最短路径。弗洛伊德算法依次找从Vi到Vj，中间经过结点序号不大于0的最短路径，不大于1的最短路径，直到中间顶点序号不大于n-1的最短路径，从中选取最小值，即为Vi到Vj的最短路径。- Functionality of the code: Freud algorithm for each of the shortest path between ver
Cshoortestwayl
- 经典最短路径算法C C++ 邻接矩阵实现 -Classic shortest path algorithm C C++ adjacency matrix to achieve
Floyd
- Floyd算法的matlab实现。对输入的邻接距离矩阵计算图中任意两点间的最短距离矩阵和路由矩阵，且能查询任意两点间的最短距离和路由。并根据结果自动绘制出了最短路径图。 程序中使用了前向路由和回溯路由两种方法，并对于无向图进一步减小算法复杂度。-Matlab implementation of the Floyd algorithm. Adjacent input distance matrix between any two points in calculating the figur
Dijkstra
- 用Djkstra算法求最短路径程序 功能: 应用Dijkstra算法求图上二顶点之间的最短距离 // 输入: 带权图的权邻接矩阵M, 顶点个数n, n个顶点的编号为0,1,...,n-1, 对应矩阵M下标 // 起始顶点编号start, 终止顶点编号end // 输出: 函数返回最短距离 // 注释: 顶点编号为0,1,...,n-1,对应邻接矩阵下标 // 集合T中的无穷大用0表示, 输入邻接矩阵M时没有直接连接的边的权输为0值,表示无穷大 // 所输入的邻接矩阵M
ant-colony-algorithm-
- 使用网格离散化的方法对带有障碍物的环境建模，使用邻接矩阵存储该环境，使得问题转化为蚁群算法寻找最短路径。-Using a grid discretization method modeling environment with obstacles, the environment, the adjacency matrix storage problem into the ant colony algorithm to find the shortest path.
cunchujiegou
- 采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。 -Adjacency matrix storage to the network, to establish a network and single-source shortest path algorithm.
zuiduanshengcengshu
- 最短生成树的Prim算法，输入邻接矩阵，输出最短路径。（离散数学的最短生成树程序实现）-Shortest spanning tree the Prim algorithm of input adjacency matrix, output shortest path. (Discrete Mathematics shortest spanning tree program)
guanjianlujingwenti-
- 用拓扑排序、邻接矩阵存储 结构建图、for语句的灵活运用，栈及数组来实现最短路径问题-Topological sorting adjacency matrix storage structure building plans, the flexible use of the for statement, stacks and arrays to achieve the shortest path problem
Floyd
- 用弗洛伊德算法实现最短路径的求解，用到的抽象数据类型为邻接矩阵类型和有向图类型类型-Floyd algorithm to achieve the shortest path to solve abstract data types used in the adjacency matrix type and have the type of diagram types
dijstla-(2)
- 数据结构中用邻接矩阵实现的迪杰斯特拉最短路径的路径输出-Data structure using adjacency matrix of the Dijkstra shortest path path output