Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - floyd C

Search list

[Special Effects] mfc visual c++ 6.0 讀檔、寫檔 抖動顯示

Description: 此程式為mfc visual c++ 6.0 內容包含讀檔、寫檔、複製、貼上、 bayer抖動顯示 floyd stdinberg抖動顯示
Platform: | Size: 210106 | Author: porkp617 | Hits:

[Data structs] 最短路径c++语言

Description: 用从c＋＋写的floyd最短路径算法，可以求邻接矩阵任意两点的最短路径。-from using c++ to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.
Platform: | Size: 38912 | Author: | Hits:

[Other] Grraph1234

Description: Dijkstrat和Floyd算法实现。 算法请参考《通信网理论基础》周炯磐-Dijkstrat and Floyd algorithm. Algorithm Reference "communications network theoretical foundation", Zhou Jiong Line
Platform: | Size: 239616 | Author: 飞扬 | Hits:

[Special Effects] Floyd-Steinberg

Description: Floyd-Steinberg算法的源代码.要注意的是，误差传播有时会引起流水效应，即误差不断向下，向右累加传播。解决的办法是：奇数行从左到右传播，偶数行从右到左传播。-Floyd-Steinberg algorithm source code. It should be noted, Error Propagation sometimes causes water effects, that is, constant downward error, right cumulative spread. The solution is : OK whatever odd communication, even from right-to-left line transmission.
Platform: | Size: 1024 | Author: 陆芸 | Hits:

[matlab] floydsf

Description: 最短路算法------floyd算法 -shortest path algorithm------ floyd Algorithm
Platform: | Size: 1024 | Author: 林洋 | Hits:

[Algorithm] floyd

Description: floyd算法的C实现！！ ！！ ！！ 1-floyd algorithm realize the C! ! ! ! ! ! ! ! ! ! 1
Platform: | Size: 1024 | Author: zuowu | Hits:

[source in ebook] Floyd

Description: Floyd最短路径算法的MATLAB程序，经过测试-Floyd shortest path algorithm of MATLAB procedures tested
Platform: | Size: 1024 | Author: zuotian | Hits:

[source in ebook] floy

Description: floyd算法 数据结构 求最短路径-floyd algorithm for data structure for shortest path
Platform: | Size: 258048 | Author: Liang | Hits:

[source in ebook] Floyd-Warshall-c-chengxi

Description: Floyd-Warshall算法描述 1)适用范围： a)APSP(All Pairs Shortest Paths) b)稠密图效果最佳 c)边权可正可负 2)算法描述： a)初始化：dis[u,v]=w[u,v] b)For k:=1 to n For i:=1 to n For j:=1 to n If dis[i,j]>dis[i,k]+dis[k,j] Then Dis[I,j]:=dis[I,k]+dis[k,j] c)算法结束：dis即为所有点对的最短路径矩阵 3)算法小结：此算法简单有效，由于三重循环结构紧凑，对于稠密图，效率要高于执行|V|次Dijkstra算法。时间复杂度O(n^3)。 考虑下列变形：如(I,j)∈E则dis[I,j]初始为1,else初始为0，这样的Floyd算法最后的最短路径矩阵即成为一个判断I,j是否有通路的矩阵。更简单的，我们可以把dis设成boolean类型，则每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”来代替算法描述中的蓝色部分，可以更直观地得到I,j的连通情况。 -err
Platform: | Size: 3072 | Author: 江晨 | Hits:

[Data structs] Floyd

Description: 实现Floyd算法的程序，用vc++编写，清楚易懂-Floyd algorithm realize the procedure, using vc++ Prepared, clear and understandable
Platform: | Size: 209920 | Author: damxie | Hits:

[Data structs] FLOYD

Description: 数据结构中有关FLOYD算法的VC++程序，帮助大家理解FLOYD这个数据结构-Data structure relating to FLOYD algorithm VC++ Procedures to help everyone understand the data structure FLOYD
Platform: | Size: 1862656 | Author: 杨博 | Hits:

[CSharp] Floyd

Description: 最短路径的Floyd算法，是用ｃ＃编的，经典的算法-Floyd shortest path algorithm, is made with c
Platform: | Size: 29696 | Author: 史习云 | Hits:

[Other] graph_

Description: //有向图:有向图,无向图基本操作 //运行环境：VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environment: VC// directed graph, undirected graph basic operation, including:// 1, adjacency matrix// 2, the adjacent table// 3 , depth-first traversal// 4, breadth-first traversal// 5, minimum spanning tree// 6, topological sorting// 7, each of the shortest path between vertices (Dijkstra, Floyd two algorithms)
Platform: | Size: 3072 | Author: atom | Hits:

[source in ebook] Graph

Description: 图的基类以及最短路径算法，dijkstra,floyd，Kruskal算法等，代码来自北大赵海燕老师编著的数据结构与算法。-Graph base class as well as the shortest path algorithm, dijkstra, floyd, Kruskal algorithm, code Zhao Haiyan teachers from Beijing University and edited by the data structure and algorithm.
Platform: | Size: 663552 | Author: 张淼 | Hits:

[Data structs] floyd

Description: floyd算法c实现，可以用来求所有节点对之间的最短路径值。-implementation of floyd algorithm using c
Platform: | Size: 1024 | Author: wyg | Hits:

[Linux-Unix] l-grafi

Description: Floyd-wharshall algoritm for the shortest path problem. I wrote this in C. It s easy to compile and work in all *nix like systems.-Floyd-wharshall algoritm for the shortest path problem. I wrote this in C. It s easy to compile and work in all*nix like systems.
Platform: | Size: 27648 | Author: lupsyn | Hits:

[Algorithm] floyd_warshall.c

Description: 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
Platform: | Size: 8192 | Author: Roger | Hits:

[matlab] floyd

Description: C语言实现弗洛伊德路径搜索，同时为了提供接口，使用命令行方式给出原始矩阵地址，并且也已txt文本形式将结果保存。测试效果：一个需要在MATLAB中运行8秒的矩阵，在使用该程序时，总共只用了5秒（MATLAB初始化数据+调用该程序+该程序运行+返回至MATALB所用的时间）。而在MATLAB中使用该程序与调用函数相差不大。-C language Freud path search, and in order to provide an interface, use the command line gives the address of the original matrix, and also save results in text form txt. Test Results: A need to run 8 seconds in the MATLAB matrix, in the use of the program, a total of only 5 seconds (MATLAB initializing the program+ data+ call+ back to the program running time spent MATALB). In MATLAB, use the program with little difference between calling a function.
Platform: | Size: 20480 | Author: wjn_nb | Hits:

[MPI] floyd.c.tar

Description: This the source code for floyd s algorithm in mpi-This is the source code for floyd s algorithm in mpi
Platform: | Size: 1024 | Author: dibyam | Hits:

[Other] Floyd-C-programming

Description: 数学建模 最短路径的编程实现Floyd C编程-The shortest path programming Floyd C programming
Platform: | Size: 1024 | Author: 夏商 | Hits:
« 12 3 4 5 6 »

CodeBus www.codebus.net