搜索资源列表
graph
- c++实现的有向图的临界矩阵构造，深度广度的遍历。-c++ achieved critical digraph matrix structure, depth, breadth Ergodic.
graph
- 图的遍历 能实现深度 广度遍历 还有文挡-Graph traversal to realize the depth of breadth traversal also text block
Graph
- 本程序实现图的深度优先和广度优先遍历，本程序调试无误，可在vc6.0环境中编译成功！-This procedure to achieve graph depth-first and breadth-first traversal, the program debugging accurate, can be successfully compiled vc6.0 environment!
123222
- Delphi 梦幻西游刷经验 Gloal.dcu Graph.dcu Graph.pas helper.dll key.dcu mainunit.dcu mainunit.dfm mainunit.pas mh.JPG Mouse.dcu MPHP.dcu-Delphi Fantasy Westward Journey experience Brush Gloal.dcuGraph.dcuGraph.pashelper.dllkey.dcumain
lujin
- 最短路径问题（用无向图表示n个城市之间的交通网络建设规划，顶点表示城市，边上的权表示该线路的造价，试设计一个方案，使得这个交通网的总造价最小。）-The shortest path problem (with undirected graph n cities that transport links between the construction plan, vertex, said city, said the right edge of the construction cost of
isoak1Java
- a molecular graph kernel based on iterative graph similarity and optimal assignments -a molecular graph kernel based on iterative graph similarity and optimal assignments
GraphTheory
- 这是关于图论的源代码和ppt的讲解，图论是一种非常经典的理论，运用也非常广泛。但是，图论的源代码写起来不是那么容易，这也就是为什么上传这个，方便大家。-This is on the graph theory ppt source code and explanations, graph theory is a very classical theory, the application is also very extensive. However, the graph theory to wr
implementation_bensch
- this a another graph cut and maxflow source-this is a another graph cut and maxflow source
DataStructTest
- This will calculate the shortest path of a graph-This will calculate the shortest path of a graph
11
- 带权图的最短路径问题,主要介绍单源最短路径算法，最短路径问题的提法很多，其它的最短路径问题均可用单源最短路径算法予以解决-Weighted graph shortest path problem, mainly introduce single-source shortest path algorithm, the shortest path problem formulation of a lot of other shortest path problem can be used singl
GraphCut
- 对Vladimir Kolmogorov，Yuri Boykov大牛的算法杰作——Graph Cut进行使用演示，代码力求精简，可供Graph Cut初学者参考学习。已通过VS2005编译。-Of Vladimir Kolmogorov, Yuri Boykov big cow masterpiece algorithm- Graph Cut for the use of demonstration, the code to be simple, for beginners Reference
GraphCut
- Graph cut segmentationis is segment an image into two classes based on color.
Graph
- 多段图最短路径问题，求一个多段图源点到目的点的最短消耗-Multi-segment graph shortest path problem, and more than one paragraph map source to the destination point of the shortest consumption
cycles
- Write a program to decide if a graph has a cycle or not. The given graph can be a directed or undirected graph, which is indicated at the time of reading the input (0 for directed graph and 1 for undirected graphs). The input is given as an adjacency
DataStruture-Graph
- 1.7.1 图的邻接矩阵存储表示 311 范例1-102 图的邻接矩阵存储表示 ∷相关函数：CreateFAG函数 CreateDG函数 1.7.2 图的邻接表存储表示 324 范例1-103 图的邻接表存储表示 324 ∷相关函数：CreateFAG函数 1.7.3 有向图的十字链表存储表示 335 范例1-104 有向图的十字链表存储表示 335 ∷相关函数：CreateDG函数 1.7.4 无向图的邻接多重表存储表示 344 范例1-105 无向图
adaptive
- adaptive threshold for liver segmentation project through graph cut algorithm
TemperatureMeasurement
- Temperature measurement & Graph Drawing
DirectShow
- DirectShow开发指南源码 陆其明老师书带的源码，有几个很不错的实例。学流媒体不错的资源 。 下载内容说明： readme.txt：本说明文件。 Chapter04：第4章用到的代码，其中AppIPTransform为MFC Filter的例子， DsDemo是一些演示代码，FilterTitleOverlay是字符叠加Filter的源代码。 Chapter05：第5章用到的代码，其中GraphBuilding为Filter Graph构建技术 的一些代码，S
Graphtheory_typicalalgorithm
- 本书介绍了有关图论的基本概念和典型的图论算法，结合历届赛题分析如何把一个实际问题抽象化为数学中的图论问题，并给出了程序解法。本书的特点是既有基本概念的讲解及对所解问题的分析，又有编程的思路与参考程序。 本书是参加奥林匹克竞赛学生的必读书，也可作为大学生的参考书。 -This book introduces the basic concepts of graph theory and graph theory, a typical algorithm, combined with analys
Program
- Implementation of Graph Theory Algorithms (ToolBox)