搜索资源列表
Graph-traversal-spanning-tree
- 1．显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量。 2．当用户选择的功能错误时，系统会输出相应的提示。 3．通过图操作的实现，把一些实际生活中的具体的事物抽象出来-Shown FIG s adjacency matrix, graph the adjlink, depth-first traversal, breadth first traverse, minimum spanning tree m
1-108
- 数据结构拓扑排序算法，有向图中产生一种拓扑排序序列。基于栈和邻接表的存储结构实现-Topological sort
graph
- 用邻接表的方式建立一个图，可以对这个图进行删除边，增加边，删除增加节点，和深度广度优先搜索-With the adjacency list of ways to build a map, you can delete the edges of this graph, increasing side, remove the added nodes, and depth of breadth-first search
tu
- 采用邻接表存储结构，编写一个判别无向图中任意给定的两个顶点之间是否存在一条长度为k的简单路径的算法。-Using the neighbor table to store the structure, the preparation of a judge not to any given graph between two vertices if there exists a simple path of length k of the algorithm.
linjiebiao
- 用邻接表实现对图的编程，并且可以求出最短路径-Map with the adjacency list implementation of the programming, and can find the shortest path
ALGraph
- 无向图的邻接表存储。包括具体操作，如建立、销毁、插入、删除等。-Undirected adjacency table storage. Including specific operations, such as the creation, destruction, insert, delete and so on.
tu
- 图的邻接表建立以深度，广度优先及遍历，和最短路径-Adjacency table to establish the depth and breadth-first traversal, and the shortest path
tudelinjiejuzhen
- 分别利用邻接矩阵和邻接表作为存储结构来实现图的存储。-Were used as the adjacency matrix and adjacency list stored in the storage structure to implement plans.
5
- 1．定义图的数据结构。 2．编写函数，用邻接表实现图的存储结构，求图的顶点的度数。 3．编写函数，输出图的遍历序列。-1. Definition of graph data structure. 2. Write a function, with the adjacency list of the storage structure to achieve chart, find the vertex of degree. 3. Write a function, the output g
tu
- 数据结构的图的建立和周游，用矩阵建立和用邻接表建立-Data structure and the Establishment and travel, to establish and use a matrix to establish adjacency list
LibTopoSort
- 数据结构中的关键路径算法，用邻接表实现，VC6环境，能正常运行-The critical path data structure algorithms, to achieve with the adjacency list
LJJZ
- 显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量-Shows the adjacency matrix, adjacency table, depth-first traversal, breadth-first traversal, minimum spanning tree PRIM algorithm, minimum spanning tree KRUSCAL algorithm, graph conn
Graph
- 介绍了邻接表和邻接矩阵的转换，对于很多刚学习数据结构的人来说，很有用-Describes the adjacency list and adjacency matrix conversion, just to learn the data structure for many people, very useful
6_3
- 采用邻接表存储结构编写Dijkstra算法，实现求从源点到其余顶点的最短路径。-Storage Structure adjacency list prepared by Dijkstra algorithm to achieve from the source to find the shortest path to the rest of the vertex.
1-103
- 有向图，有向网，无向图，无向网的邻接表存储、增删顶点和边。-Directed graph, directed networks, undirected graph without adjacent to the network table to store, add and delete vertices and edges.
092880-4
- 图的相关操作，涉及到邻接矩阵，邻接表，深度优先、广度优先遍历等等。-Graph related operations, involving adjacency matrix, adjacency table, depth first, breadth-first traversal and so on.
src
- java 数据结构 邻接表 广度宽度-java datastructure adjmatrix width deep
TU2
- 编写程序以邻接矩阵或邻接表的方式存储指定连通图。然后分别用深度优先算法和广度优先算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。-Write a program to the adjacency matrix or adjacency list stored in a manner specified connected. Then were used to depth-first traversal algorithm and the breadth-first algorithm stor
aa
- 图的邻接表存储及深度优先遍历的实现代码 实现代码-Adjacency table to store and depth-first traversal of the implementation code
tudebianli
- 使用邻接表存储结构，编写一个程序，实现对有向图遍历操作。是用C++编写的程序源代码。-Storage structure using the adjacency list, write a program to achieve a directed graph traversal operations. Is a program written in C++ source code.