Description: On any given plan (not less than 20 vertices, edges not less than 30, the type of plan can be a directed graph, undirected graph, the network, not the network), can enter the vertex and edge (or arc) of the information, and stored in the corresponding storage structure (adjacency matrix, adjacency table, cross linked, adjacent to multiple tables, in which two types optional), created their own plan to complete the following:
Undirected graph on each vertex of degree requirements, or request a directed graph each vertex-degree and out-degree (5 points)
Complete the insertion of vertices and edges (or arcs) of the function (5 points)
Complete deletion of vertices and edges (or arcs) of the function (5 points)
The conversion of two storage structures (5 points), if one of the storage structure for the cross-linked or adjacent multi-table is an increase of 5 points.
Depth-first traversal output graph breadth-first traversal sequences or sequence (5 points)
Graph of the depth-fi
To Search:
- [Sink] - err
- [min_spintree] - Given an arbitrary undirected graph, the
- [hj] - Graph Algorithms (1) will map the inform
- [DATA_STRUCTURE] - Title: Discriminant diagram two vertices
- [traffic] - Adjacency matrix structure the use of a
- [compile] - 3, compiler largest absolute principle o
- [tulun] - By mouse click interface, draw a graph s
File list (Check if you may need any files):
aaa.cpp
Download