搜索资源列表
tu
- 1、创建图用邻接矩阵表示 2、邻接矩阵输出 3、插入顶点 4、插入边-1, create a graph adjacency matrix that used 2, output adjacency matrix 3, insert the top 4, insert the edge
chengshijiaotongbianlitu
- 城市交通遍历图，1、由数据文件生成邻接表，2、输出图邻接表，3、度优先遍历图，4广度优先遍历图-Urban traffic traverse map, 1, data files generated by the adjacent table, 2, the output graph adjacency list, 3, priority ergodic map, Figure 4, breadth-first traversal
adjacency_link
- 使用VC建立无向图的邻接表。再通过简单的打印函数遍历整张图，输入各个节点信息。-Establish the adjacency link of the no direction graph based on VC. And then prints the whole graph through the simple print function, and outputs the information of all the nodes.
Dijkstra_AdjMtrx
- 用c++实现的以邻接矩阵为输入的Dijkstra算法，可以输出图中任意两点间的最短距离矩阵-Using c++ implementation of the adjacency matrix as input to the Dijkstra algorithm can output the graph of the shortest distance between any two matrices
Graph_byArray
- 一个邻接矩阵表示的图型结构，可帮助了解图的数组表示法，理清很多基本概念。可以用VC直接编译运行。-An adjacency matrix representation of the map structure, can help to understand the array graph representation, clarifying many of the basic concepts. VC can be directly translated to run.
code
- 学习数据结构时编写的有关二叉树基本运算实现，有向图和邻接矩阵，邻接表的转换，输出某矩阵转置矩阵的三元组以及两矩阵进行运算后结果用三元组表示，在学习VC程序设计写了一个简单的机场不同型号车辆的收费系统。-Learning data structures to prepare basic operations on binary tree realization of a directed graph and the adjacency matrix, adjacency list of the c
4-creatDG
- 1、 图的存储结构的定义和图的创建 图的种类有：有向图、无向图、有向网、无向网。 图的存储结构可采用：邻接矩阵、邻接表。 要求：分别给出邻接矩阵和邻接表在某一种图上的创建算法 -1, Figure storage structure definition and diagram types to create plans are: a directed graph, undirected graph, directed networks, undirected networks.
p1
- 建立有向图的邻接表. 图的信息从键盘输入。-create the adjacency list of a directed graph. Input the information of the graph through keyborad.
BuildAndOutputDiagramForC
- 用C语言实现数据结构中的图的建立和输出，可实现输出有向图和无向图，由用户自己选择建立有向图还是无向图的邻接矩阵。用户输入图的定点和边的信息，存储到相应的存储结构中去，而后输出图的邻接矩阵。-Data structure using C language implementation of the map creation and output, enabling the output have to map and undirected graph, chosen by the user to
FindaMininalSpanningTree
- 输入含权图的邻接矩阵，输出最小生成树的邻接矩阵 1、本实验用到的理论知识 Prim算法 算法设计 设图G =（V，E），其生成树的顶点集合为U。 ①、把v0放入U。 ②、在所有u∈U，v∈V-U的边(u，v)∈E中找一条最小权值的边，加入生成树。 ③、把②找到的边的v加入U集合。如果U集合已有n个元素，则结束，否则继续执行②。-Enter the right graph with adjacency matrix, the output of the ad
EulerCircuit
- 实验报告 含代码 输入一个图G的N*N的邻接矩阵M,若G是欧拉图,则输出”图G是欧拉图” 否则,输出”图G不是欧拉图”-Enter the code lab report with a graph G, N* N adjacency matrix M, if G is the Euler diagram, then the output " Figure G is the Euler map" otherwise, output " Figure G is no
1
- 1.建立一个无向图的邻接表存储 2。对该图进行深度优先搜索，按顺序输出所访问的-1. The establishment of an undirected graph in adjacency list is stored 2. Depth-first search of the graph, according to the order of the output of the visit
Graph2vertexpathproblem
- 试基于图的深度优先搜索策略编写一程序，判断以邻接表方式存储的有向图中是否存在 由顶点Vi到Vj顶点的路径。 -Test graph-based depth-first search strategy for the preparation of a program to determine ways to adjacency list stored in the existence of a directed graph from vertex Vi to vertex Vj pat
6
- 用邻接矩阵表示的图的Dijkstra算法的源程序-With the adjacency matrix of the graph Dijkstra algorithm source code
ds_5
- 1．定义图的数据结构。 2．编写函数，用邻接表实现图的存储结构，求图的顶点的度数。 3．编写函数，输出图的遍历序列。-1. The definition of graph data structure. 2. Write a function, using adjacency list implementation diagram of the storage structure, find the vertex of degree. 3. Write a function, the o
tuguangshou
- 图的广搜 用邻接矩阵创建图 广度搜索 图 输出 图对应的编号-Figure wide search to create map with the adjacency matrix breadth of search graph output map corresponding to the number
tu3
- 1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） 3 编写一个主函数，将上面函数连在一起，构成一个完整程序。 4 将实验源程序调试并运行。 -Create a storage structure of a given graph from the adjacency list and adjacency matrix
jsj
- 1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） -Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps
liantongtu
- 给定n个结点的有向图的邻接矩阵，可判断该图是否为强连通的，单向连通的，或弱连通的。-For a given n-node directed graph adjacency matrix, can determine whether the plan strongly connected, and one-way connected, or weak connectivity.
main
- 采用邻接矩阵表示无向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列。本输入样例中所用的图如下所示： Input Format: 第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数 第二行输入各顶点的信息，即输入每个顶点字符 第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行 Output format: 首先输出图的顶点信息，输出完毕换行 接着输出图的邻