搜索资源列表
-
0下载：
Dijkstra算法的研究对象是赋权有向图（图用加权矩阵表示）的单源最短路径问题。可以求出任意节点到其他所有节点的最短距离。-The research object is the Dijkstra algorithm of weighted directed graph ( graph with weighted matrix) of single source shortest path problem. Can be obtained any node to all other nodes
-
-
0下载：
题目：编制一个求出网中最短路径的程序.
问题描述:计算一个有向网中位置为0 的点到其余各顶点的最短路径，以一个网状的带权有向图G6为测试内容
-Topic: establishment of a network to derive the shortest path procedure. Problem Descr iption: Calculate a network location to the point of 0 to the remaining vertex of the s
-
-
0下载：
带权有向图最短路径算法 Dijkstra算法-Weighted directed graph shortest path algorithm shortest path algorithm Dijkstra algorithm
-
-
0下载：
给定带权有向图 ，其中每条边的权都是非负实数。另外，还给定V中的一个顶点，称为源点。现在要计算从源到所有其它各顶点的最短路长度。这里路的长度是指路上各边权之和；-Given weighted directed graph, where each edge of the right of all non-negative real number. In addition, the return of a vertex set V, called the source. Now calculated
-
-
0下载：
带权有向图的最短路径及拓补排序算法,用于计算最短路径的算法-Weighted directed graph of shortest paths and expand up sorting algorithm used to calculate the shortest path algorithm
-
-
0下载：
Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。 -Floyd algorithm, also known as Floyd algorithm, insertion point method, is used to find a given weighted graph algorithm shortest path between vertices.
-
-
0下载：
插点法一种用于寻找给定的加权图中顶点间最短路径的算法-Insertion point method for finding a given weighted graph algorithm shortest path between vertices
-
-
1下载：
）根据校园图设计带权图，图的顶点表示各地点，存放地点名称、代码、简介等信息；图的边表示路径，存放路径长度等相关信息。（校园图能手动输入或者文件导入）
2）提供任意地点相关信息的查询。
3）提供任意地点的问路查询，即查询任意两个景点之间的一条最短的简单路径。
4）提供多个地点的最佳访问路线查询，即求途经这些地点的最佳（短）路径。
-) According to the campus map design a weighted graph, the vertex that locat
-
-
0下载：
Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。
-Floyd algorithm, also known as Floyd algorithm, insertion point method, is used to search for a given weighted graph algorithm shortest path between vertices.
-
-
0下载：
Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。-Floyd algorithm, also known as Floyd algorithm, insertion point method, is used to find a given vertex-weighted graph shortest path algorithm.
-
-
0下载：
从语言编写的模拟校园导游 可求最短路径 无向带权图-From the language of the shortest-path simulation Campus Tour rectifiable undirected weighted graph
-
-
0下载：
带权有向图最短路径算法。应该可以直接运行的，很方便。-Weighted directed graph shortest path algorithm. Should be able to run directly, it is convenient.
-
-
0下载：
Floyd算法，Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法-Floyd algorithm, the Floyd algorithm, also known as Freud algorithm, interpolation point method is used to find a given weighted graph between vertices shortest path algorithm
-
-
0下载：
Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。-Floyd algorithm, also known as Freud algorithm, interpolation point method, is a given weighted graph to find the shortest path algorithm vertices.
-
-
0下载：
代码的功能：用弗洛伊德算法求每一对顶点之间的最短路径的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
-
-
0下载：
Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。该算法名称以创始人之一、1978年图灵奖获得者、斯坦福大学计算机科学系教授罗伯特·弗洛伊德命名。-Floyd algorithm, also known as Freud algorithm, the insertion point method is an algorithm used to find the shortest path between vertices given weighted g
-
-
0下载：
Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。该算法名称以创始人之一、1978年图灵奖获得者、斯坦福大学计算机科学系教授罗伯特·弗洛伊德命名。-Floyd algorithm, also known as Freud algorithm, the insertion point method is an algorithm used to find the shortest path between vertices given weighted g
-
-
0下载：
Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法-Floyd algorithm, also known as Freud algorithm, the insertion point method is an algorithm used to find the shortest path between vertices given weighted graph. The algorithm name to one of the founders,
-
-
0下载：
对于有向带权图中从一个确定结点到其余各结点的最短路径问题，狄克斯特拉斯提出按路径长度递增顺序逐步产生最短路径的算法构造。- 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
-
-
0下载：
Floyd算法又称为弗洛伊德算法、插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。(Floyd algorithm, also known as plug-in method, is an algorithm for finding the shortest path between vertices in a given weighted graph.)
-
