Description: Adjacency list storage structure, writing depth first, breadth-first algorithm.
2 adjacency list storage structure, the preparation of the minimum spanning tree algorithm.
3 to the adjacent table storage structure, the to write shortest path algorithm.
Adjacency list storage structure, written in non-recursive depth-first and breadth-first algorithm. A binary list storage structure, written preamble, inorder, postorder and level order traversal of a binary tree algorithm.
2 binary linked list storage structure, written to calculate the binary tree depth, the total number of all nodes, leaf nodes, the number of two-child node, the number of single-child node algorithm
Preorder, inorder, postorder and level order traversal of a binary tree algorithm non-recursive (stack or queue)
To Search:
File list (Check if you may need any files):
图
..\7538071b-f133-38ab-8290-c1c9482f2dec.jpg
..\Debug
..\.....\图.exe
..\.....\图.ilk
..\.....\图.pdb
..\图
..\..\Debug
..\..\.....\BuildLog.htm
..\..\.....\Graphlnk.obj
..\..\.....\main.obj
..\..\.....\mt.dep
..\..\.....\vc90.idb
..\..\.....\vc90.pdb
..\..\.....\图.exe.intermediate.manifest
..\..\Graphlnk.cpp
..\..\Graphlnk.h
..\..\LinkedQueue.h
..\..\LinkedStack.h
..\..\MinHeap.h
..\..\MinSpanTree.h
..\..\main.cpp
..\..\图.vcproj
..\..\图.vcproj.PC-20120218GURE.Administrator.user
..\..\图.vcproj.cse-202-5.Administrator.user
..\图.ncb
..\图.sln
..\图.suo
Download