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: 1493 |
Author:林静 |
Hits:
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: 1.首先选定图的类别（有向图、无向图），再选定图的存储结构，根据输入的顶点或者边建立图；并把相应的邻接表或者邻接矩阵输出；
2.根据已有的邻接矩阵或邻接表用递归方法编写深度优先搜索遍历算法，并输出遍历结果；
-1. First of all selected map type (directed graph, undirected graph), re-selected map storage structure, under the Importation of the establishment of the vertex or edge map and the corresponding adjacency list or adjacency matrix output 2. According to Some adjacency matrix or adjacency list prepared by the recursive depth-first search method traversal algorithm, and output traversal results Platform: |
Size: 1024 |
Author:异元 |
Hits:
Description: 1、 图的存储结构的定义和图的创建
图的种类有：有向图、无向图、有向网、无向网。
图的存储结构可采用：邻接矩阵、邻接表。
要求：分别给出邻接矩阵和邻接表在某一种图上的创建算法
2、 图的遍历：非递归的深度优先搜索算法、广度优先搜索算法。
3、 图的深度遍历的应用：求无向连通图中的关节点（教材P177-178,算法7.10和7.11）
4、 图的广度遍历的应用：给定图G，输出从顶点v0到其余每个顶点的最短路径，要求输出各路径中的顶点信息。
-1, map storage structure definition and graph types to create graph: directed graph, undirected graph, to the network without the network. Map storage structure can be: adjacency matrix, adjacency table. Requirements: adjacency matrix is given, respectively, and adjacent table in a certain kind of map creation algorithm 2, Graph Traversal: Non-recursive depth-first search algorithms, breadth-first search algorithm. 3, graph traversal depth of applications: for undirected connected graph of the joint points (textbooks P177-178, Algorithm 7.10 and 7.11) 4, Fig traverse the breadth of applications: a given graph G, the output from vertex v0 to The rest of each vertex of the shortest path requires the output of the vertex of the path information. Platform: |
Size: 6144 |
Author:mhb |
Hits:
Description: 无向图的深度优先搜索算法/c语言实现 其中图采用邻接矩阵存储 -Undirected graph of the depth-first search algorithm/c language in which Fig realize the use of adjacency matrix storage Platform: |
Size: 1024 |
Author:罗军 |
Hits:
Description: 用c做的图的数据结构的作业,建立有向图,深度\广度搜索,分为递归和非递归方式.-C to do with the map data structure operations, the establishment has to map the depth of breadth of search, is divided into recursive and non-recursive way. Platform: |
Size: 2048 |
Author:liuzhi |
Hits:
Description: 图的算法的基本训练
1、 图的存储结构的定义和图的创建
图的种类有：有向图、无向图、有向网、无向网。
图的存储结构可采用：邻接矩阵、邻接表。
要求：分别给出邻接矩阵和邻接表在某一种图上的创建算法
2、 图的遍历：非递归的深度优先搜索算法、广度优先搜索算法。
3、 图的深度遍历的应用：求无向连通图中的关节点（教材P177-178,算法7.10和7.11）
4、 图的广度遍历的应用：给定图G，输出从顶点v0到其余每个顶点的最短路径，要求输出各路径中的顶点信息。
-Map of the basic training algorithm 1 and the storage structure of the definition and plans to create the types of plans are: directed graph, undirected graph, to the network, no to the network. Map storage structure can be: adjacency matrix, the adjacent table. Requirements: adjacency matrix is given, respectively, and adjacent table in a certain kind of map creation algorithm 2, graph traversal: Non-recursive depth-first search algorithm, breadth-first search algorithm. 3, graph traversal depth of applications: for Undirected connected graph of the key points (teaching P177-178, Algorithm 7.10 and 7.11) 4, Fig traverse the breadth of applications: a given graph G, the output from the vertex v0 to The rest of each vertex of the shortest path, the path of the output requirements of the vertex information. Platform: |
Size: 7168 |
Author:bueaty |
Hits:
Description: 本书收集了当前国内几本比较流行的数据结构算法书中的算法，在Visual C++6.0平台上将其编写成可以直接运行的程序。对有些算法，还给出了多种程序设计方案实现，以迅速提高程序员的算法与程序设计能力。
本书遵循数据结构算法书中的体系，将全书分为九章对应之，以便阅读。它们是：顺序存储结构的表、堆栈和队列，链式存储结构的表、堆栈和队列，数组、串和广义表，递归，树和二叉树，图，排序，查找，文件。本书的光盘中含有108个完整的程序源代码、可执行文件。本书适合于想要通过编程实例学习数据结构的C++程序员，也可以作为高校师生学习计算机编程与数据结构的参考书，尤其适合报考计算机软件专业研究生的人员与参加信息奥赛班学习的人员参考。
-This book has collected some of the more popular current internal data structure algorithm algorithms book, the Visual C++6.0 platform will be written into their direct running. For some algorithms, also gives the design to achieve a variety of procedures to quickly improve the programmer s algorithms and programming skills.
This book follows the book s system data structure algorithms, the book is divided into nine chapters corresponding to read. They are: the order of the storage structure of tables, stacks and queues, linked storage structure of the tables, stacks and queues, arrays, strings and generalized form, recursive, tree and binary tree, graph, sort, search, document. Book, CD-ROM contains 108 full source code, executable file. Book for instance you want to learn data structures by programming the C++ programmers can also serve as college teachers and students to learn computer programming and data structures of reference, especially for graduate students registered for co Platform: |
Size: 9426944 |
Author:wyk |
Hits:
Description: 遍历算法在数据结构中是最普通的运算方法也是所有其它算法的基础。由于图的遍历比线性表、树的结构的遍历算法要复杂,因此着重对图的遍历算法进行讨论, 具有更普遍的意义。图的遍历就是从图中指定的某顶点作为遍历的起始出发点, 按照一定搜索遍历路径, 对图中所有顶点仅作一次访问的过程。
根据搜索路径方向的不同, 遍历图的方法可分深度优先搜索遍历和广度优先搜索遍历, 又根据编制算法的方法不同, 可分为递归遍历算法和非递归遍历算法。
-Data structure traversal algorithm is the most common method of operation is the basis for all other algorithms. Traverse the graph than the linear form, the structure of the tree traversal algorithm to complex, focusing on the discussion of graph traversal algorithms, a more general significance. Graph traversal is from a specified vertex graph traversal starting as a starting point, according to a certain search path traversal, all vertices of the graph for a visit only the process. Under the direction of the search path is different graph traversal methods can be divided into depth-first search traversal and breadth-first search traversal, but also according to different methods of preparation method, can be divided into non-recursive traversal algorithms and recursive traversal algorithms. Platform: |
Size: 229376 |
Author:庄小虎 |
Hits:
Description: 已知图采用邻接表存储，写出深度优先搜索算法的非递归形式
对邻接表存储的图采用非递归的深度优先搜索
该程序只适合有向连通图，可以用邻接表这样的一个图进行测试-Figure adjacency list is stored to write a depth-first search algorithm non-recursive form of
Adjacency list stored in the diagram using non-recursive depth-first search
The program is only suitable for a graph to a connected graph, with adjacency list for testing Platform: |
Size: 1024 |
Author:胡婷 |
Hits:
Description: 图的遍历及实验报告。输入构建一个无向图，将其用深度优先搜索的递归和非递归遍历以及广度优先搜索遍历，并输出。-Graph traversal and experimental reports. Input to build a non-directed graph, its recursive and non-recursive traversal depth-first search, and breadth-first search traversal, and output. Platform: |
Size: 179200 |
Author:heyuhong |
Hits:
Description: recursive Depth first search is adopted to traverse the whole graph
- recursive Depth first search is adopted to traverse the whole graph
Platform: |
Size: 189440 |
Author:zerb |
Hits:
Description: 无向图的遍历搜索，可以实现非递归深度搜素和广度搜索。-Undirected graph traversal search, you can achieve a non-recursive depth the Su-search and breadth of the search. Platform: |
Size: 1024 |
Author:小王 |
Hits:
Description: 几乎包含了图的所有操作，邻接矩阵，邻接表建立，递归非递归深搜广艘遍历，floyd,prim,kruscal,地界斯特拉算法，拓扑排序，关键路径-Figure includes almost all the operations, the adjacency matrix, adjacency list creation, deep search recursive non-recursive traversal wide ship, floyd, prim, kruscal, boundary Stella algorithm, topological sorting, the critical path Platform: |
Size: 1448960 |
Author:宁淡淡 |
Hits:
Description: 采用图的邻接矩阵或邻接表实现最短路径问题中图的存储，采用递归程序实现图的深度优先搜索（DFS）-Using adjacency matrix or adjacency list shortest path problem in memory map, using a recursive program implements graph depth-first search Platform: |
Size: 1024 |
Author:秦丽婷 |
Hits:
Search - search graph recursive