Description: 图的操作,包括,图的基本存储方法,有关图的操作算法并用C语言编程实现,图的搜索路径的遍历方法,以邻接矩阵和邻接表的方式存储连通图。然后分别用优先深度算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。深度优先遍历的递归算法 （1）深度优先遍历算法（2）邻接表表示的深度优先搜索算法（3）邻接矩阵表示的深度优先搜索算法.-plan of operation, including, map the basic storage methods, the operation of the map algorithm and C language programming. map of the search path traversal methods to the adjacency matrix and adjacency list of storage connected graph. Then, using the priority traversal algorithm depth of the matrix adjacent to the storage map and the adjacent forms storage plans. Depth-first traversal of the recursive algorithm (1) depth-first traversal algorithm (2) adjoining table depth-first search algorithm ( 3) adjacency matrix of depth-first search algorithm. Platform: |
Size: 1024 |
Author:林静 |
Hits:
Description: [输入]
图的顶点个数N，图中顶点之间的关系及起点A和终点B
[输出]
若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点
[存储结构]
图采用邻接矩阵的方式存储。
[算法的基本思想]
采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。
#include<stdio.h>
int number //队列类型
typedef struct{
int q[20]
-[imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then visit the adjacent vertices ... and so on until finding B, the first to reach point B path, must be at least a few side paths. Queue used to achieve record was visited by the vertex. Each visit with the team atop the points are adjacent to the vertex, then t Platform: |
Size: 10240 |
Author:Demonic |
Hits:
Description: 最小生成树kruskal算法用邻接矩阵做图-Kruskal minimum spanning tree algorithm to do with adjacency matrix graph Platform: |
Size: 1024 |
Author:yan yao |
Hits:
Description: 图可以采用邻接矩阵、邻接表等多种方式来存储，本程序实现图的邻接矩阵存储-Chart can be used adjacency matrix, adjacency lists to store a variety of ways, this program graph adjacency matrix storage Platform: |
Size: 1024 |
Author:youjing |
Hits:
Description: Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path. Platform: |
Size: 2048 |
Author:jazz |
Hits:
Description: Edge Disjoint Cycles. You are given an input graph that is either directed or undirected. Write a program that reads in a vertex number and lists the number of edge disjoint cycles that start and end at this vertex. The output should also list the edges in each of the cycle discovered. Input will be the adjacency matrix preceded by a 0 or 1 representing Directed or Undirected graphs respectively. Platform: |
Size: 1024 |
Author:jazz |
Hits:
Description: 图的建立，有多种的图可以选择，也可以选择图的遍历方法，里面的图的存储结构是以顶点数组和邻接矩阵的方式存储的。-Map-building, there are several plans to choose, you can choose to graph traversal method, which the storage structure of the plan is based on vertex adjacency matrix of the array and stored the. Platform: |
Size: 2048 |
Author:韩寒 |
Hits:
Description: 使用C语言实现的邻接矩阵，程序中使用了数据结构和算法的一些简单的知识。-Using C language of the realization of the adjacency matrix, and the program was used in data structure and algorithms of some simple knowledge. Platform: |
Size: 1024 |
Author:xiangwei |
Hits:
Description: 利用邻接矩阵实现图的遍历，C++源代码，能通过编译。-Using adjacency matrix of graphs can traverse, c++ source code, can to compile.
Platform: |
Size: 38912 |
Author:杨振 |
Hits:
Description: 使用邻接矩阵作为存储结构构造图，并完成图的建立，深度遍历，广度遍历-Use the adjacency matrix as a storage structure structure diagram, and complete the establishment of the Figure, deep traversal, breadth traversal Platform: |
Size: 4096 |
Author:single |
Hits:
Description: 分别以邻接矩阵和邻接表的存储结构建立图。
分别对图进行深度优先遍历和广度优先遍历。
求图中边的数目。
求顶点0到图中其余每个顶点的最短路径-Respectively adjacency matrix and adjacency list storage structure created map. Respectively graph depth-first traversal and breadth-first traversal. In the figure, the number of edges. Find graph vertex 0 to each of the remaining vertices of the shortest path Platform: |
Size: 3072 |
Author:yokko |
Hits:
Description: matlab程序，其功能为将邻接表转换为邻接矩阵，非常方便。(Matlab program, its function is to convert adjacency table to adjacency matrix, very convenient.) Platform: |
Size: 15360 |
Author:宋可可
|
Hits:
Description: (1)使用邻接矩阵表示图，定义相应的抽象数据类型。
(2)实现两个图ADTs的上述函数。
(3)从空图开始，生成图形对象表示图1所示的图形，将顶点和边逐一插入。
(4)以BFS方式遍历图。((1) Use adjacency matrix to represent graphs and define the corresponding abstract data type.
(2) Realize all the above functions for the two graph ADTs.
(3) Starting from an empty graph, generate a graph object represent the graph shown in Fig. 1 by inserting the vertices and edges one by one.
(4) Traverse the graph in BFS manner.) Platform: |
Size: 13312 |
Author:mia_shao |
Hits:
Search - adjacency matrix