Description: Realize undirected graph (or digraph) express storage and output of the graph breadth-first (or depth-first) traversal. The system has the following features: 1. Initialization. From the keyboard input graph Vertices and edges. 2. The corresponding output map of the store said. 3. Output graph breadth-first traversal sequence. 4. Output graph depth-first traversal sequence.
- [criticalpathalgorithm.Rar] - operating procedures! In order to facili
- [graphtheory.Rar] - BFS, DFS, to the map, no map to the real
- [mapinterface.Rar] - plans to establish the adjacent table, d
- [BFSandDFS] - written in C source is a function respec
- [data] - Abstract: This procedure will create a s
- [graph1] - 1, map storage structure definition and
- [mpc2810-vc2] - MPC2810 is the music creators Automation
- [mpc2810-vc3] - MPC2810 is the music creators Automation
- [DiGraphs] - Directed graph of a painting process. Wh
- [zxj] - A topological sort The basic steps of th
File list (Check if you may need any files):
Download