Description: Data storage structure diagram and the basic operational requirements: ⑴ can build chart based on the input vertex, edge/arc of information ⑵ achieve graph vertices, edges/arc insertion, deletion ⑶ achieve depth-first traversal of the graph ⑷ realize the breadth-first traversal graph. Note: a single number based on the adjacency matrix, based on double number adjacency table storage structure to achieve the above action.
To Search:
File list (Check if you may need any files):
图.c
Download