Location:
Search - G CODE GRAPH
Search list
Description: 很好用的DirectDraw画图代码-good use of DirectDraw drawing code
Platform: |
Size: 65536 |
Author: 杨逸 |
Hits:
Description: 图论算法及其MATLAB 程序代码求赋权图G = ( V , E , F ) 中任意两点间-Graph Theory Algorithm and MATLAB code for weighted graph G = (V, E, F) between two points in arbitrary
Platform: |
Size: 47104 |
Author: hujik |
Hits:
Description: 自己写的一个图的转换CMD 程序
nodag.txt是一个有环图演示输入文件.
dag.txt是一个无环图演示输入文件.
g.c 为主程序文件
stackar.c 为堆栈定义和调用文件
run.exe 为已编译好的可执行文件
我编写了一个MAKEFILE文件.如果不使用MAKEFILE 请在g.c文件的头部添加
#include "stackar.c"
然后再直接编译g.c.
使用了堆栈的演示代码.-Their own plans to write a conversion CMD process has nodag.txt is a DAG input file presentation. Dag.txt acyclic graph is a demonstration of the input file. Gc main program file stackar.c for the definition and call the document stack run.exe have compiled executable file, I prepared a Makefile file. If you do not use the Makefile file in the head gc add# include stackar.c and then direct the compiler uses the stack gc demo code.
Platform: |
Size: 13312 |
Author: gaoquan |
Hits:
Description: 在XP系统中大家会发现资源管理器左边有个很漂亮的面板，最近使用Nero刻录软件也发了类似的面板，很不错，自己也向做一个，经过努力终于完成，效果图都在压缩包中，包括：“测试组合菜单框G模式为不透明”和“使用背景贴图模式”
源码提供了基本的使用方法，大家也可以在里面放置自己需要的东西，效果如下，本源代码中没有给出其详细的代码，但大家可以自己动手修改，以满足自己的需要效果看到这里希望能够给大家提供一些收获，提供的源代码大家可以随便使用和修改。-In the XP system, you will find Resource Manager on the left has a very nice panel, recently used Nero burning software, also made a similar panel, very good, and he is to do one, through the efforts finally completed, the effect graph in the compressed package, including: "Test combo box menu mode for opaque G" and "use background texture pattern"
Provides the basic source code to use, it can be placed inside the things they need, the effect is as follows, origin of the code did not give its detailed code, but we can change yourself in order to meet their own needs to see results here hope to provide some harvest, providing the source code you can freely use and modify.
Platform: |
Size: 575488 |
Author: chenruibin |
Hits:
Description: 实验报告 含代码
输入一个图G的N*N的邻接矩阵M,若G是欧拉图,则输出”图G是欧拉图” 否则,输出”图G不是欧拉图”-Enter the code lab report with a graph G, N* N adjacency matrix M, if G is the Euler diagram, then the output " Figure G is the Euler map" otherwise, output " Figure G is not a Euler diagram"
Platform: |
Size: 17408 |
Author: jhp627 |
Hits:
Description: k-g算法中平均信干比随用户数变化曲线图代码-kg algorithm, the average signal to interference ratio with the number of users change the code graph
Platform: |
Size: 1024 |
Author: 陈炳啸 |
Hits:
Description: 图论算法及其MATLAB 程序代码
1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法
2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法
3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法
6.-Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.
Platform: |
Size: 47104 |
Author: 肖翔 |
Hits:
Description: 怎么判断一个采用邻接表结构的有向图G是否为强连通图? 强连通块划分代码实现-Adjacency list used to determine how the structure of a directed graph G is a strongly connected graph? Strongly connected block of code division
Platform: |
Size: 1024 |
Author: csjzky |
Hits:
Description: Kruskal算法和Prim算法
任何只由G的边构成,并包含G的所有顶点的树称为G的生成树(G连通).
加权无向图G的生成树的代价是该生成树的所有边的代码(权)的和.
最小代价生成树是其所有生成树中代价最小的生成树.-Kruskal algorithm and Prim algorithm
Any edge of only by G, is composed of all the vertices containing G tree called G of the spanning tree (G connected).
The weighted no directed graph G is the price of spanning tree all the spanning tree right on the edge of the code () and.
The lowest cost spanning tree is in all its spanning tree minimum cost of the spanning tree.
Platform: |
Size: 1024 |
Author: 江洋 |
Hits:
Description:
This a beta version of the superpixel code. It hasn t been
thoroughly tested on different architectures. It was tested on
a Linux system with Matlab 7.1, with gcc and g++ compilers.
-The random walker algorithm was introduced in the paper:
Leo Grady and Gareth Funka-Lea, Multi-Label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical Potentials , in Proceedings of the 8th ECCV04, Workshop
This is a beta version of the superpixel code. It hasn t been
thoroughly tested on different architectures. It was tested on
a Linux system with Matlab 7.1, with gcc and g++ compilers.
Platform: |
Size: 246784 |
Author: jike |
Hits:
Description: 常用图论算法及其MATLAB程序代码：
1.最短路的Warshall-Floyd算法
2.最小生成树Kruskal避圈法
3.二部图G的最大匹配的算法(匈牙利算法)(The commonly used graph theory algorithm and its MATLAB program code:
1. shortest path Warshall-Floyd algorithm
2. minimum spanning tree Kruskal avoidance method
3. the maximum matching algorithm of the two part graph G (Hungary algorithm))
Platform: |
Size: 37888 |
Author: 解码 |
Hits: