文件名称:tgdbl
介绍说明－－下载内容均来自于网络，请自行研究使用
对于一个给定的任意边数和顶点值的有向图或无向图，用邻接表存储,并用广度优先搜索算法实现对图的遍历,借助队列实现。
-For a given arbitrary value of edges and vertices of the directed graph or undirected graph, with adjacency table storage, and realize the breadth-first search algorithm for graph traversal, with queues realize.
-For a given arbitrary value of edges and vertices of the directed graph or undirected graph, with adjacency table storage, and realize the breadth-first search algorithm for graph traversal, with queues realize.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
tgdbl.c