对任意给定的图（顶点数不小于20，边数不少于30，图的类型可以是有向图、无向图、有向网、无向网），能够输入图的顶点和边（或弧）的信息，并存储到相应存储结构（邻接矩阵、邻接表、十字链表、邻接多重表，任选其中两种类型），对自己所创建的图完成以下操作：

-For any given map (not less than 20 vertices, edges not less than 30, the type of map can be a directed graph, undirected graph, directed network, undirected 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 multi-table, choose one of two types), created their own plans to do the following: