搜索资源列表
leasttree
- 输入无向图的邻接矩阵，使用前面讲过的任意三种方法求该图的最小代价生成树，并分析各自的时间复杂度。-Enter the undirected graph of adjacency matrix, said in front of the arbitrary use of three methods for the minimum cost spanning tree graph, and analyze their time comple
min_spintree
- 在给定的任意一个无向图中，利用反圈算法找出最小支撑树，得到一个图的连通性判断-Given an arbitrary undirected graph, the use of anti-loop algorithm to find minimum spanning tree, get a map to determine connectivity
DATA_STRUCTURE
- 题 目: 判别图中两个顶点之间的简单路径的程序设计 初始条件： （1） 采用邻接表作为存储结构。 （2） 编写程序判别无向图中任意给定的两个顶点之间是否存在一条长度为k的简单路径。 （3） 测试用例自己设计。 -Title: Discriminant diagram two vertices of a simple path between the program design of initial conditi
algorithmsinjavapart5
- Java 图算法, 包括最短路径, 有向图算法, 无向图算法, 网络流算法, 等-Java graph algorithm, including the shortest path algorithm for directed graph, undirected graph algorithms, network flow algorithms, such as
tu
- 1、 用邻接表作为存储结构创建无向图 2、 分别用深度优先和广度优先遍历无向图-1, with the adjacent table as a storage structure to create undirected graph 2, respectively, with depth-first and breadth-first traversal undirected graph
xiaoyuan
- 用无向网表示学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息， 图中的边表示景点间的道路，存放路径长度等信息。要求能够回答有关景点介绍、游览路径等问题。游 客通过终端可询问： （1）从某一景点到另一景点的最短路径。(最短路径问题) （2）游客从公园进入，选取一条最佳路线。 （3）使游客可以不重复地浏览各景点，最后回到出口（出口就在入口旁边）。 [基本要求] （1）将导游图看作一
shuju.txt
- 实现连通无向图的深度优先和广度优先遍历以用户指定的结点为起点分别输出每种遍历下的结点访问序列和相应生成树的边集。-Undirected graph connectivity realize the depth and breadth-first traversal of priority to user-specified node as a starting point, respectively, under the output
cut
- 无向图的最大割:对于给定的无向图G，设计一个优先队列式分支限界法，计算G的最大割。-Undirected graph of the largest cut: For a given undirected graph G, the design of a priority queue-type branch and bound method to calculate G, the largest cut.
shortestpath
- 图的遍历，在连通的无向图上访问全部节点的操作-Graph traversal, in the undirected graph connectivity to access all the nodes to operate
bingchaji
- 树结构实现得并查集数据结构，用来求无向图的最小生成树。 具有较高价值!值得使用-Tree structure and the realization of a search set data structure, used for undirected graph of the minimum spanning tree. Have a higher value! Worth using
DS
- 内含多种经典数据结构的实现和注释，其中包括二叉树，哈夫曼树，键树，Trie树，有向图，无向图的实现以及各种排序算法。-Containing a variety of classic data structures and the realization of the Notes, including the tree, Huffman tree, key tree, Trie tree, directed graph, undirect
liantong
- 输入图，找出该图的所有连通支。图用“邻接矩阵”法表示。用两个数组来存储图：一个数组（一维）存储图中顶点集；另一个数组（二维）映象图中顶点间的关系集。且对于无向图而言，其邻接矩阵是对称的。-Input map, to find the map of all the connected extension. Chart with
nettransmition
- 基于层级网络和无向图网络的知识传递效率仿真程序。-Based on the level of networks and undirected graph knowledge transfer efficiency of the network simulation program.
KrusKal
- 对一个带权无向图，求其最小生成树，本程序功能通过KrusKal算法实现。-Of a weighted undirected graph, and its minimum spanning tree, the program features through the Kruskal algorithm.
GRAPH3
- 实现图的遍历，主要是实现对无向图中是否存在有值为k的路径的算法实现-The realization of graph traversal, mainly the realization of undirected graph whether there is a value of k path algorithm
SCCandBC
- 求强连通分支，和双连通分支，输入两个文件，分别记录有向图和无向图-For strongly connected branch, and dual-branch connectivity, enter the two documents were recorded to map and undirected graph
tu
- 图的深度优先遍历包括图的建立，分有向图和无向图-Graph depth-first traversal, including the establishment of plans, sub-directed graph and undirected graph
lujin
- 最短路径问题（用无向图表示n个城市之间的交通网络建设规划，顶点表示城市，边上的权表示该线路的造价，试设计一个方案，使得这个交通网的总造价最小。）-The shortest path problem (with undirected graph n cities that transport links between the construction plan, vertex, said city, said the right edg
ex2_biconnected_components
- 输入为一个无向图，实现双联通子图的查找，用eclipse实现-Enter for a undirected graph, double Unicom subgraph finding, using eclipse the achievement of
C_Course_Design(Include_Report)
- 数据结构课程设计(C版) 包括 运动会积分系统 简单文档编辑 无向图的基本操作实现 哈夫曼树编码解码 染色N皇后算法 调试报告-Data structure course design (C version) including Games integral system document editing simple undirected graph the basic operation of the r