搜索资源列表
minspantree
- 最小生成树的克鲁斯卡尔算法 采用邻接矩阵存储图，用树表示和实现集合操作-Kruskal minimum spanning tree algorithm uses the adjacency matrix memory map, with trees and realize that the collection operation
CreatGraph
- 存储图，无论有向图无向图或有向网无向网.可以存储任何类型-Memory map, regardless of the undirected graph or network to network without the
graph
- 图子系统实验，定义了图的存储结构，以及队列操作。包括邻接矩阵，深度优先遍历，以及广度优先遍历-Figure subsystem test, defines the memory structure map and queue operations. Including the adjacency matrix, depth-first traversal and breadth-first traversal
DFS
- DFS算法，我自己写的，主要用邻接矩阵存储图-DFS algorithm, I wrote it myself, the main memory map with the adjacency matrix
Studymeterialsfordatastructure
- 数据结构课件（[数据结构(C语言版)].严蔚敏.吴伟民.课件.第04章-串，第05章-数组和广义表，第06章-树和二叉树，第07章-图，第08章-动态存储管理，第09章-查找）-Study meterials for data structure (C language version). Weimin Yan&Weimin Wu . Including: Chapter 04- strings Chapter 05- arrays and generalized list