搜索资源列表
无向图的邻接表生成和显示
- 这个源程序是关于无向图的邻接表生成和显示的，可以用这个程序实现-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算法求无向图的最小生成树
判断一个连通无向图是否为二部图
- 判断一个连通无向图是否为二部图 利用两个集合存放两个不相交的子集,Determine whether a connected undirected graph is a bipartite graph
TU.rar
- 邻结表存储的无向图的建立及遍历输出（包括深度优先与广度优先搜索）, The neighbour ties the table to save non- (first first searches to the chart establishment and the calendar output including depth with breadth)
DJalgorithm
- 迪杰斯特拉算法的C语言实现，可以完成有向图和无向图的最短路径搜索-Dijkstra algorithm C language, can be completed with the graph and undirected graph of the shortest path
1
- 无向图 遍历链表并依次输出其的结点值向网表示n个城市之间通信网络的建设计划-Undirected graph traversal list and followed by the output node of its value to the net means that n communication network between the cities plan to build
M
- 给定一个无向图，相邻两个图不能着相同颜色，求多少种颜色将每个顶点着色-Give an undirected graph, adjacent to the two plans should not the same color, the number of colors for each vertex shaders
create_algraphic
- 图的建立，里面包括有向图和无向图的建立，还有带权值的建立方法，也有图的输出算法，图的存储结构是以邻接链表的形式存储的。-The establishment of plans, which include the maps and the establishment of undirected graph, as well as with the establishment of methods of weight, but also the output graph algorithms, ma
application_of_undirected_network
- 内含源码，以及可执行的exe文件，系统使用说明（tc2.0下运行）。程序可以实现以下功能： 1. 创建无向网。可以输入最多30个城市的信息（输入的城市是连通的）：城市的名字，两个城市之间的距离，两个城市之间的票价。 2. 以文件的形式保存输入的城市的信息。 3. 求连通所有城市的最短路径，并用图形界面显示最短路径。 4. 求任意两个城市之间的的最短路径，并用图形界面显示最短路径。 5. 用图形界面显示网络 程序在TC2.0下实现，dos界面，适合C语言初学者练习-Con
3
- 设计一个有向图和一个无向图，任选一种存储结构，完成有向图和无向图的DFS（深度优先遍历）和BFS（广度优先遍历）的操作。-Design of a directed graph and an undirected graph, either type of storage structure, the completion of a directed graph and an undirected graph of the DFS (depth-first traversal) and BFS (
Graph
- 1．建立无向网的邻接矩阵。 要求：从键盘输入无向网的顶点数和边数；然后以“顶点1，顶点2，权值”的方式输入图的各边，建立邻接矩阵存储，并输出各顶点和邻接矩阵。 2．对无向网进行深度优先遍历，输出遍历序列。 3.判断给定的无向网是否是连通的？ 要求：从键盘上输入出发点进行搜索遍历，输出遍历序列。 -1. The establishment of the network adjacency matrix. Requirements: No input from the ke
Graph
- 有向图/无向图的建立及相应的邻接矩阵的输出，并进行深度/广度优先遍历结点再输出结果-Directed graph/no corresponding to the diagrams of the adjacency matrix of the output, and depth/breadth-first traversal and then the output node
哈密顿
- 由c语言编程，在window下运行，为无向图，先读入两个数据，第一个数据为点的个数，第二个数据为边的个数。此后依次输入哪两个点之前连线，即完成无向图。之后程序会输出0和1,0代表不存在哈密顿回路，1代表存在哈密顿回路(Programming by C language, run under window, for undirected graph, read two data first, the first data is the number of points, the second da
无向图两点间简单路径
- 若无向图表示高速公路网，其中顶点表示城市，边表示城市之间的高速公路。试设计一个找路程序，获取两个城市之间的所有简单路径(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 design a path finding program
无向图
- 无向图的创建，转化为邻接矩阵输出，及深度、广度优先遍历(The creation of undirected graph is transformed into adjacency matrix output and depth and breadth first traversal.)
Graph traversal algorithm
- 图的搜索（遍历）算法是图型结构相关算法的基础，编写程序演示无向图三种典型存储结构的建立和（搜索）遍历过程。(The search (or traversal) algorithm of the graph is the basis of graph-structure-related algorithms. The program is written to demonstrate the establishment and (search) traversal process of the t
RandomGraphCreation
- 用于计算ER随机图，可随机生成一定节点数量的无向连通图。(Randomly generate undirected graph)
无向图
- 广工数据结构实验-（无向图）基于邻接数组的无向图的接口实现（含源代码+实验报告+可执行程序）(Data structure experiment - (undirected graph) interface implementation of undirected graph based on adjacency array (including source code + experiment report + executable program))