搜索资源列表
无向图的邻接表生成和显示
- 这个源程序是关于无向图的邻接表生成和显示的，可以用这个程序实现-the source of the undirected graph generation and adjacent table shows, this procedure can be used to achieve
在无向完全图中寻找边不重复的汉密尔顿回路
- 图论课程设计：在无向完全图中寻找边不重复的汉密尔顿回路-graph theory of curriculum design : no plans to seek full side will not repeat the Hamilton circuit
姬小兵的无向图邻接表
- 我自己编写的无向图邻接表-myself prepared by the undirected graph adjacent table
用Prim算法求无向图的最小生成树
- 用Prim算法求无向图的最小生成树
TU
- 邻结表存储的无向图的建立及遍历输出（包括深度优先与广度优先搜索）- The neighbour ties the table to save non- (first first searches to the chart establishment and the calendar output including depth with breadth)
姬小兵的无向图邻接表
- 我自己编写的无向图邻接表-myself prepared by the undirected graph adjacent table
图的遍历演示
- 一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Descr iption many issues involving maps of algorithms are to traverse the map-bas
图论
- BFS、DFS、有向图、无向图中的各种算法的实现，可以自动生成图形。-BFS, DFS, to the map, no map to the realization of the algorithm can be automatically generated graphics.
无向图的邻接表生成和显示
- 这个源程序是关于无向图的邻接表生成和显示的，可以用这个程序实现-the source of the undirected graph generation and adjacent table shows, this procedure can be used to achieve
在无向完全图中寻找边不重复的汉密尔顿回路
- 图论课程设计：在无向完全图中寻找边不重复的汉密尔顿回路-graph theory of curriculum design : no plans to seek full side will not repeat the Hamilton circuit
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.
GONGCHEN
- C语言程序求最短路径问题,是无向图方面的. 数据结构中的图论-C language program for the shortest path problem, and there is no plan to the area. Data structure of the graph theory
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
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
tudebianli
- 一、 程序分析 1． 以邻接多重表为存储结构，实现连通或非连通的无向图的深度优先与广度优先遍历。 2． 设图的结点不超过30个，每个结点用一个编号表示。通过输入图的边输入一个图，每条边为一个数对。 3． 问题描述： 4． 以第一个结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边。 -First, program analysis 1. To the adjacent multi-table for the
prim
- 算法分析与设计，基于随机生成的无向图的prim算法实现-Algorithm Analysis and Design, based on randomly generated undirected graph of the prim algorithm
无向图两点间简单路径
- 若无向图表示高速公路网，其中顶点表示城市，边表示城市之间的高速公路。试设计一个找路程序，获取两个城市之间的所有简单路径(If an undirected graph is used to express a highway network, the vertices represent the city, and the side represents the expressway between the cities. Try to
无向图
- 无向图的创建，转化为邻接矩阵输出，及深度、广度优先遍历(The creation of undirected graph is transformed into adjacency matrix output and depth and breadth first traversal.)
无向图
- 广工数据结构实验-（无向图）基于邻接数组的无向图的接口实现（含源代码+实验报告+可执行程序）(Data structure experiment - (undirected graph) interface implementation of undirected graph based on adjacency array (including source code + experiment report + executable