搜索资源列表
有向无环图操作示例代码
- 有向无环图操作示例代码-a directed acyclic graph operation code examples
CalAM
- 计算无向图中各像素之间的Affinity matrix，可以用来作为各种聚类算法之前的像素距离计算-without calculation to map the pixel matrix between the Affinity, can be used for clustering algorithms before the pixel distance
min_spintree
- 在给定的任意一个无向图中，利用反圈算法找出最小支撑树，得到一个图的连通性判断
ApplicationsOfDepth-FirstTraversal
- 1. 用ＤＦＳ判断一个无向图是否是连通图； 2. 为有向图的边分类，将它们的边分为前向边、后向边和交叉边； 3. 用ＤＦＳ和点消除求有向图的拓扑排序； 4. 判断有向图是不是强连通图，若不是，求强连通分量； 5. 判断有向图是不是半连同图； 6. 判断有向图是不是单连通图； 7. 判断无向图是不是双连通图。 通过以上编程对ＤＦＳ的应用，进一步了解ＤＦＳ的算法及它所代表的算法思想。 -1. Using DFS to test if a given undirecte
bintree.py.tar
- 图的可视化输出，将无向图输出为图片形式，使用 Yapgvb 库-Graph visualization, outputing undirectional graph in image format, using Yapgvb
Map22
- 一个基于VC的有向无环图操作实例源代码 一个基于VC的有向无环图操作实例源代码-一个基于VC的有向无环图操作实例源代码
min_tree
- 从conf.txt文件读取无向图矩阵 PRIM算法分步实现最小生成树-File read from conf.txt PRIM algorithm for undirected graph matrix step by step to achieve the minimum spanning tree
7788
- 大名鼎鼎的方帅的博士学位论文---目前,计算机智能视频监控在理论和应用上都面临着很多难题,国内外大批学者投身于该领域的研究和探索,并且取得了大量的成果.本文是在这些成果的基础上,对计算机智能视频监控系统的关键技术进行研究.主要贡献可概括如下:首先,对目标检测技术进行了研究,并提出了一种基于背景建模的运动目标检测算法.利用统计的方法建立了基于颜色和颜色梯度的背景模型,并实时地对背景模型进行更新,最后将这两种背景模型综合考虑对目标进行了有效的检测.接着,研究了复杂背景下多目标跟踪问题,提出了基于蒙特
LargeGraphs2DLayout
- 画图算法（graph drawing):用算法自动地画无向大图，可用于可视化及社会关系网络等。作者博士学习期间的研究。含代码和论文。-Graph Drawing: an important branch of information visualization. This algorithm package is to draw large undirected graphs
GreatGraphite
- 利用邻接多重表进行无向图的存储并在此基础上实现有关于图的基本操作。-Multiple tables using non-adjacent to the store and on this graph based on the basic operations on the graph.
tudebianli
- 建立图的存储结构（图的类型可以是有向图、无向图、有向网、无向网，学生可以任选两种类型），能够输入图的顶点和边的信息，并存储到相应存储结构中，而后输出图的邻接矩阵。-Establishment of the storage structure map (map type can be a directed graph, undirected graph, directed networks, undirected networks, students may choose one of two
tudecaozuo
- 有向图,无向图基本操作,包括: 1、邻接矩阵 2、邻接表 3、深度优先遍历 4、广度优先遍历 5、最小生成树 6、拓扑排序 7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-Directed graph, undirected graph, basic operations, including: 1, 2 adjacency matrix, adjacency table 3, 4 depth-first traversal, breadth-f
agorithm-analysis
- 无向图连通分支的C运算，通过深度优先算法实现-biconnected components
TuSuanFa
- 图算法，创建无向图，实现深度优先搜索和宽度优先搜索，用到队列和Kruskal算法。-Figure algorithm, create no to figure, realize the depth first search and width first search, use queue and Kruskal algorithm.
graphViz4Matlab-29Apr2010
- graphviz4matlab是把有向和无向图显示在图形窗口的matlab软件包。-GraphViz4Matlab is a MATLAB software package to display directed and undirected graphs within a figure window,
tu
- 根据图论中的有向图和无向图进行最短路径问题的求解。-Based on graph theory to the map and no shortest path problem solving directed graph.
wangluotuopu
- 功能是将邻接矩阵或关联矩阵变为有向或者无向网络图，有结果显示。-Function is to convert the adjacency matrix or the correlation matrix becomes directed or undirected network diagram, results show.
2008021106bianli
- 本代码主要用于建立无向图并输出 深度优化遍历图 广度优化遍历图 还可以退出本系统。-The code is mainly used for the establishment of an undirected graph optimization traversal Figure breadth optimization traverse the map can also exit the system and output depth.
CREAT_LINJIE_MATRIX
- 根据线路参数里的起始节点和终止节点编号确定无向图的邻接矩阵及测试案例(The adjacency matrix of the undirected graph is determined according to the start node and the termination node number in the line parameter)