搜索资源列表
111
- 将一个无向图的邻接表转换为邻接矩阵 已手动运行 100 可行-An undirected graph adjacency list adjacency matrix have been converted to run 100 feasible to manually
tree
- 用无向图表示n个城市之间的交通网络建设规划，顶点表示城市，边上的权表示该线路的造价，试设计一个方案，使得这个交通网的总造价最小，即求最小生成树问题。-Undirected graph with n cities that traffic between the network construction plan, the vertices represent the city, right next to that the cost of the line, try to design a pr
UGM
- 一个关于无向图推理模型的代码，可用于图像处理-An undirected graph inference on the model code
CourseSystem1
- 教学计划，可自动排列课程并显示课程表，且可以画出无向图-Teaching programs, can automatically arrange and display the curriculum courses, and can draw an undirected graph
hold
- 用邻接表的方式建立有向，无向图，有向，无向网-Used to establish adjacency list, undirected graph, directed, undirected network
connected
- 判断无向图是否连通,如果连通则输出“连通”，否则输出“不连通”-whether the undirected graph is connected
database-Graph
- 一：实验目的： （1）掌握图的存储思想及其存储实现。 （2）掌握图的深度、广度优先遍历算法思想及其程序实现。 （3）掌握图的常见应用算法的思想及其程序实现。 （4）理解有向无环图、最短路径等算法 二：实验内容： 以下实验内容，1和2为必做内容，3为选做内容。 1.有向图 （1）键盘输入数据，建立一个有向图的邻接表，并输出该邻接表。 （2）在有向图的邻接表的基础上计算各顶点的度，并输出。 （3）以有向图的邻接表为基础实现并输出它的拓扑排序序
linjiejuzhen
- 对任意给定的图（顶点数不小于20，边数不少于30，图的类型可以是有向图、无向图、有向网、无向网），能够输入图的顶点和边（或弧）的信息，并存储到相应存储结构（邻接矩阵、邻接表、十字链表、邻接多重表，任选其中两种类型）-For any given figure (vertices not less than 20, the side for not less than 30, graph the type can be directed graph, no to figure, was the ne
adjListGraph
- 本程序基于C++利用邻接链表实现了图的基本数据结构，有向图和无向图均适用，包含了图的存储，图的插入，图的删除等基本操作,可供数据结构学习之用。-This program realizes the class of graph using adjacent list. The fundamental function includes the storage of graph, inserting and removing edges from the graph, etc.
floyd
- 弗洛伊德算法，输入无向图中的任意两点的编号，可以得出两点间最短距离。解决最优化问题。-Floyd algorithm, the input undirected graph any two points in the number, the shortest distance between two points can be drawn. Solve the optimization problem.
c_71
- 数据结构，无向图的创建，输入边数和顶点数，以及权值，-Data structure, the creation of an undirected graph, enter the number of edges and vertices, and the weights
tutor_graph
- 一个用邻接矩阵实现的带权无向图类，体现了类的构造思想-Adjacency matrix to achieve a weighted undirected graphs
Gra1
- 有向图、有向网、无向图、无向网的创建与邻接矩阵的输出-Have to figure, was the nets, no to figure, no to create and adjacency matrix of the network of output
yiyuanxuanzhi
- n个村庄之间的无向图，边上的权值w(i,j)表示村庄i和j之间道路长度。现要从这n个村庄中选择一个村庄新建一所医院，使离医院最远的村庄到医院的路程最短。-N village of no to chart between, on the edge of the right value w (I, j) said village between I and j road length. Now from this n village to choose a village a new hospit
MinTree
- 对一个无向图求其最小生成树，图用邻接矩阵表示-Find the minimum spanning tree
bianlitu
- 试写一个利用遍历图的方法输出一条无向图G中从顶点Vi到Vj长度为L的简单路径的程序。-Traverse the graph to write a test method using a undirected graph G output from vertex Vi to Vj simple path of length L of the program.
source_code
- 1.排序算法：快排，插入排序，选择排序，冒泡排序，堆排，归并排序 2.无向图：建立邻接表，并深度遍历 3.二叉树：建树，插入叶子节点并删除，计算深度及高度，前序中序后序遍历，以及用栈实现的非递归遍历 4.二叉排序树：建树并插入、删除结点 5.通讯录：有主界面，能添加，删除查找相应的数据-1.sort:quicksort select sort,insert sort,heap sort.etc. 2.graph:create with the adjacent list,an
wuxiangtu
- 无向图的邻接矩阵实现，及广度遍历，生成最小树。-Undirected graph adjacency matrix to achieve, and the breadth traversal, generating minimum spanning tree.
Prim
- Prim算法求连通加权无向图的最小生成树,在VS2010下编写并测试通过-Prim algorithm for connected weighted undirected graph, minimum spanning tree.
wuxiangtu
- 无向图的邻接矩阵表示法验证程序的源代码比较初级便于练习-wuxiangtu linjie juzhen yanzheng chengxu yuandaima chuji