搜索资源列表
linjjiejuzhen
- 将图的邻接矩阵表示方法转化为邻接表表示方法-The adjacency matrix adjacency list representation into a representation
str1
- 邻接表与邻接矩阵互相转化，已通过测试，可直接运行-Adjacency list and adjacency matrix into each other, has been tested, can be directly run
shujujiegousuanfa
- 各种最小生成树算法 最短路径算法 邻接矩阵和邻接表的相互转化 求连通分量的算法-Interconversion of various minimum spanning tree algorithm shortest path algorithm adjacency matrix and adjacency list of requirements connected component algorithm
邻接矩阵与邻接表相互转化
- 数据结构图论部分，邻接矩阵转邻接表，用C语言实现，再加几个字才够20字(The data structure graph, adjacency matrix to the adjacency list, using C language, plus a few words to 20 words)
无向图
- 无向图的创建，转化为邻接矩阵输出，及深度、广度优先遍历(The creation of undirected graph is transformed into adjacency matrix output and depth and breadth first traversal.)