Location:
Search - folyd
Search list
Description: 自己写的Floyd,没有理解Folyd的同学可以拿去参考一下啦-Wrote it myself Floyd, do not understand Folyd students can refer to you instead!!!!
Platform: |
Size: 7168 |
Author: chengxi |
Hits:
Description: 选址问题的几种经典算法,包括缔结塔拉斯算法的matlab和c++各种语言的版本-folyd selection classic
Platform: |
Size: 117760 |
Author: jf |
Hits:
Description: Bayer抖动和Folyd-Steinberg抖动-Bayer jitter and jitter Folyd-Steinberg
Platform: |
Size: 3310592 |
Author: jiaojiao003 |
Hits:
Description: Dijkstra和folyd算法 VS2008上已经调试运行好！-Dijkstra和folyd算法 VS2008上已经调试运行好！
Platform: |
Size: 894976 |
Author: 朱吴乐 |
Hits:
Description: folyd用来处理图论中最短路径问题。对传统的folyd算法进行了优化。-folyd to deal with the shortest path in graph theory problem. Folyd the traditional optimization algorithm.
Platform: |
Size: 3633152 |
Author: 风清扬 |
Hits:
Description: 弗洛伊德算法，图论，图的遍历，对初学者有用-Floyd algorithm, graph theory, graph traversal, useful for beginners
Platform: |
Size: 6144 |
Author: coolgo |
Hits:
Description: folyd算法的matlab，很好用~非常适合在图论中的应用~-folyd algorithm matlab, with very good ~ very suitable for application in Graph Theory ~
Platform: |
Size: 1024 |
Author: chen |
Hits:
Description: 地杰斯特拉算法的matlab，很好用~非常适合在图论中的应用~-folyd algorithm matlab, with very good ~ very suitable for application in Graph Theory ~
Platform: |
Size: 1024 |
Author: chen |
Hits:
Description: 1.求所有点对的最短路径问题，设G=(V,E)是一个有向图，其中的每条边(i,j)由一个非负的长度l[i,j]，如果从顶点i到顶点j没有边，则l[i,j]=∞。要找出从每个顶点到其他所有顶点的距离，这里从顶点x到顶点y的距离是指从x到y的最短路径的长度。
2. 通过一个图的权值矩阵求出它的每两点间的最短路径矩阵。
3. 从图的带权邻接矩阵A=[a(i,j)] n×n开始，递归地进行n次更新，即由矩阵D(0)=A，按一个公式，构造出矩阵D(1)；又用同样地公式由D(1)构造出D(2)；……；最后又用同样的公式由D(n-1)构造出矩阵D(n)。矩阵D(n)的i行j列元素便是i号顶点到j号顶点的最短路径长度，称D(n)为图的距离矩阵，同时还可引入一个后继节点矩阵path来记录两点间的最短路径。-Find all points on the shortest path problem, let G = (V, E) be a directed graph, where each edge (i, j) by a non-negative length l [i, j], if from the vertex i no edge to the vertex j, then l [i, j] = ∞. To find out from each vertex to all other nodes in the distance, where the vertices from vertex x to y is the distance from x to y represents the shortest path length.
(2) the weight by a graph in which each matrix calculated shortest path between two matrices.
3 from the graph adjacency matrix with the right A = [a (i, j)] n × n starts, recursively updated n times, i.e. by the matrix D (0) = A, according to a formula is constructed matrix D (1) also used the same way by the formula D (1) construct a D (2) ...... finally use the same formula consists of D (n-1) construct a matrix D (n). Matrix D (n) of the i-th row j-th column is the i-th element of the j-th vertex to vertex of the shortest path length, called D (n) of the distance matrix of Fig, while also introducing a successo
Platform: |
Size: 4096 |
Author: suyu |
Hits: