对任意给定的图（顶点数不小于20，边数不少于30，图的类型可以是有向图、无向图、有向网、无向网），能够输入图的顶点和边（或弧）的信息，并存储到相应存储结构（邻接矩阵、邻接表、十字链表、邻接多重表，任选其中两种类型）-For any given figure (vertices not less than 20, the side for not less than 30, graph the type can be directed graph, no to figure, was the nets, no to the nets), can input figure of vertex and edge (or arc) information, and storage to the corresponding storage structure (the adjacency matrix, contiguous table, ten medium watch, watch, choose which adjacency multiple two types)