数据结构图的存储结构及基本操作

要求：

⑴能根据输入的顶点、边/弧的信息建立图；

⑵实现图中顶点、边/弧的插入、删除；

⑶实现对该图的深度优先遍历；

⑷实现对该图的广度优先遍历。

备注：单号基于邻接矩阵，双号基于邻接表存储结构实现上述操作。

-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.