搜索资源列表
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
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
030300306path.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,
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
CalAM
- 计算无向图中各像素之间的Affinity matrix，可以用来作为各种聚类算法之前的像素距离计算-without calculation to map the pixel matrix between the Affinity, can be used for clustering algorithms before the pixel distance
primandkruskal
- 普里母算法和克卢氏卡儿的关于求最短路径的无向图算法-Puri Cluj algorithm and the mother's card abuse on the shortest path algorithm undirected graph
BFS11223
- 该程序实现了 无向图的建立和广度优先搜索及输出-the program no plans to the establishment and BFS and output
chengshi
- 这个是我设计的城市交通无向图程序，里面的地点、距离已经给定（当然可以修改），运行时输入起点和终点即可。-this is my design of urban traffic undirected graph procedures inside the location, distance has been given (of course can be revised), running importation will be star
RandomGraphCreation
- 用于计算ER随机图，可随机生成一定节点数量的无向连通图。(Randomly generate undirected graph)