搜索资源列表
4
- 无向图功能实现，用邻接多重表存储该无向图，并使用动态存储结构。用一个单链表把所有顶点存储起来，在存储边的节点中给出该边的两个顶点的各自的下一条边的节点地址。-Undirected graph implementation of function, with the adjacent multi-table to store the graph, and using dynamic storage structures. With a single list of all vertices sto
Wuxiangtu
- 数据结构经典实例，以无向图的邻接多重表存储无向图。以数偶的形式依次从键盘上输入一串数据。如：(A，B)为从起始结点（其数据场之值为一大写的英文字母 A ），到终止结点（其数据场之值为一大写的英文字母 B）的无向边。最后输入（Z，Z）表示输入结束。-Classic examples of data structures in order to free the adjacency table to store multiple undirected graph. Followed by a fe
graph
- windows下实现图的所用功能，包括：创建有向图和无向图的邻接表，给出有向图的邻接表,创建出逆邻接表-windows used to achieve chart features, including: creating a directed graph and undirected graph of adjacency list is given with the adjacency table, create a reverse adjacency list, etc.
linkStateRouting
- 链路状态路由算法实现。链路状态算法又叫最短路径优先SPF（Short Path First）算法。按照SPF的要求，路由器中路由表依赖于一张能表示整个个网络拓扑结构的无向图G（V，E）。-Link state routing algorithm. Link State algorithm called the shortest path first SPF (Short Path First) algorithm. In accordance with the requirements of S
TDICCD
- 】手掌可以用于疾病诊断．掌纹线所组成的不同形状(结构)在疾病诊断中占有极其重要的地位， 准确识别这些掌纹线的不同结构，对于提高自动掌纹诊病系统的正确率有非常重要的意义．要进行有效的掌纹线 结构识别，首先必须将掌纹线结构准确地表示出来．本文提：B一种基于无向图的掌纹线结构表示方法，实验结果 表明该方法可以较为完整地表示出掌纹线的结构，这为进一步进行自动掌纹诊病研究打下了必要的基础．-】 Palm can be used for disease diagnosis. Palmprint
TSP
- 回溯法解决TSP问题，对于任何的无向图，只要存在回路均可找到，无回路也可检测出来！-Backtracking to solve TSP problem, for any undirected graph, loop as long as there can be found, no loop can be detected!
prim
- c语言实现的Prim算法，用来求无向图的最小生成树-failed to translate
xiaoyuandaohang
- 用无向图表示你所在学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等。 设计要求： 1．查询各景点的相关信息 2．查询图中任意两个景点间的最短路径 3．查询图中任意两个景点间的所有路径 -Undirected graph with the school' s campus attractions in your plan, said the main attractions of vertices, stored spots number, nam
Cpp1
- 已知一以动态存储结构形式存储的，以邻接多重表表示的无向图。请用KRUSKAL算法求出它的最小代价生成树。-Storage structure known to form a dynamic storage to multiple tables that non-adjacent to the graph. Please KRUSKAL algorithm solves the minimum cost spanning tree.
Graphtraversal
- 很多涉及图上操作的算法都是以图的遍历操作为基础的,这个程序，演示连通的无向图上，遍历全部结点的操作。-Many involved in the operation chart to graph traversal algorithms are based operation, this procedure shows connected undirected graph, the traversal operation of all nodes.
primkruskal
- 用克鲁斯卡尔（kruskal)算法求N个结点所联成的加权无向图的最小生成树，核心代码比较简单。-Using Kruskal (kruskal) algorithm to solve the N nodes are linked to form a weighted undirected graph of the minimum spanning tree, the core code simple.
rrrrrrr
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-table storage structure, connectivity undirected graph depth first and breadth-first traversal. User-specified node as a starting point, respectively, under
tubianliyanshi
- 以邻接多重表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边集。-To the adjacent multi-table storage structure, connectivity undirected graph depth first and breadth-first traversal. User-specified node as a starting point, respectively, under
neighbours-nodistance
- 输入矩阵及其阶数，通过求该矩阵德尔邻接矩阵求无向图。-The order of the input matrix and by request of the matrix Del undirected graph adjacency matrix.
Graph
- 无向图 无向网 有向图 有向网的邻接矩阵的实现-Undirected graph directed graph undirected network with the network implementation of the adjacency matrix
Kruskal
- Kruskal算法 求解无向图的最小生成树-Kruskal algorithm for minimum spanning tree of an undirected graph
createtu
- 用邻接矩阵创建图并将其输出：本程序可以有四种图形式：分别为有向图，无向图，有向网，无向网；-Create a map with the adjacency matrix and the output: This program can graph four forms: namely a directed graph, undirected graph, the network, not to the network
prim
- 建立无向图，初始化矩阵，输出无向图的邻接矩阵-The establishment of an undirected graph, initialize the matrix, the output adjacency matrix of undirected graph
ass4
- 数据结构作业4：以数偶的形式依次从键盘上输入一串数据。如：(A，B)为从起始结点（其数据场之值为一大写的英文字母 A ），到终止结点（其数据场之值为一大写的英文字母 B）的无向边。最后输入（Z，Z）表示输入结束。请用无向图的邻接多重表存储该无向图，并注意一定要使用动态存储结构。-Data Structure Assignment 4: The order of a few even in the form of a string of data input from the keyboard.
graph
- 无向图的建立以及深度优先和广度优先遍历并输出 -DFS and BFS search for a graph