搜索资源列表
BDFS
- 用邻接表表示无向图的深度优先搜索遍历 有助于大家理解图的优先遍历问题-adjoining table with no plans to the depth-first search traverse help you understand the plans of the priority issues Traversing
longest
- 输入一个带权图的无向图,求出其中一个顶点到其它顶点最长的路径,并输出这条最长路径-input with a map without the right to plan, which sought a vertex to vertex other the longest path, and the output of the longest path.
二分覆盖
- 二分图是一个无向图,它的n 个顶点可二分为集合A和集合B,且同一集合中的任意两个顶点在图中无边相连(即任何一条边都是一个顶点在集合A中,另一个在集合B中)。当且仅当B中的每个顶点至少与A中一个顶点相连时,A的一个子集A 覆盖集合B(或简单地说,A 是一个覆盖)。覆盖A 的大小即为A 中的顶点数目。当且仅当A 是覆盖B的子集中最小的时,A 为最小覆盖。-two hours map is an undirected graph, it n vertices can be divided into t
FSofGragh
- 图论中关于简单无向图的深度,广度搜索,由图形界面简单方便的演示。-on graph theory to a simple map with the breadth, depth search by the graphical interface is simple and convenient to the demonstration.
GetDegree
- 通过输入来控制是建立有向图还是无向图,输入节点数,边数,来计算每个节点的出度和如度-adopted to control importation is to establish a map or no map to the input nodes, edges, to calculate each node degrees out and if degrees
GONGCHEN
- C语言程序求最短路径问题,是无向图方面的. 数据结构中的图论-C language program for the shortest path problem, and there is no plan to the area. Data structure of the graph theory
path.cpp
- 试在虚基类Network中增加一个函数FindPaths,对于给定的无向图G 和G 中的2 个顶点v和w,输出G 中从v到w的一条简单路径。若有多条可能路径,则输出任意一条。 -test in the virtual base class to add a Network Function FindPaths. For a given undirected graph G and G, the two vertices v, w, output from the G v w to a si
daiquanwuxiangtu
- 带权无向图,是我修改别人的。自己看看能不能用-weighted undirected graph, I have altered others. See for yourself can use
tudeshixian
- 无向图的实现和深度优先算法-no plans to the realization of the depth and priority algorithm
emploeyee1
- 无向图的深度优先搜索,老师写的,绝对没错-undirected graph of the depth-first search, the teacher was absolutely right!
4.67
- 普里姆算法构造最小生成树,无向图的深度优先搜索。数据结构作业答案。老师写的-Primbetov minimum spanning tree algorithm structure, no plans to the depth-first search. Operating data structure answer. Teachers write! !
AOESEARCH
- 无向图的邻接表的建立和遍历-no plans to the table adjacent to the establishment and ergodic
sujujiegou
- 数据结构的一些常用算法实现。单链表。无向图排序等-data structure of some commonly used algorithm. Single-Chain. No plans to sort etc.
564561354654
- 包括无向图的深度优先搜索,普里姆算法构造最小生成树,数据结构习题的答案-including undirected graph of the depth-first search, Primbetov tectonic minimum spanning tree algorithm and data structure Exercise answer!
tubianli
- 以邻接表为存储结构,实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点,分别输出每种遍历下的结点访问序列和相应生成树的边集。-table adjacent to the structure for storage, connectivity to the map without the depth and breadth of priority priority traversal. Users designated as a starting point node, the out
CalAM
- 计算无向图中各像素之间的Affinity matrix,可以用来作为各种聚类算法之前的像素距离计算-without calculation to map the pixel matrix between the Affinity, can be used for clustering algorithms before the pixel distance
sy10(1)
- 图的存储结构与遍历 (1)画出如图(1)所示无向图的邻接矩阵和邻接表,列出该图的广度优先遍历和深度优先遍历结果(选定A为出发点进行遍历)。 (2)画出如图(2)所示有向图的邻接矩阵和邻接表,列出该图的广度优先遍历和深度优先遍历结果(选定A为出发点进行遍历)(The storage structure of the graph and traversal (1) draw the adjacency matrix and adjacency list of the und
图的生成
- 设计无向网的图文件格式,读取图文件,生成基于邻接矩阵和邻接表的无向网,并将邻接矩阵表示法和邻接表表示法相互转换。(The graph file format of the undirected network is designed, the graph files are read, the undirected network based on the adjacency matrix and the adjacency table is generated, and the adjacen
RandomGraphCreation
- 用于计算ER随机图,可随机生成一定节点数量的无向连通图。(Randomly generate undirected graph)
图的遍历。
- 7、无向图,根据任意一个初始顶点,输出图的深度优先搜索遍历路径和广度优先搜索遍历路径。