数据结构经典实例，以无向图的邻接多重表存储无向图。以数偶的形式依次从键盘上输入一串数据。如：(A，B)为从起始结点（其数据场之值为一大写的英文字母 A ），到终止结点（其数据场之值为一大写的英文字母 B）的无向边。最后输入（Z，Z）表示输入结束。-Classic examples of data structures in order to free the adjacency table to store multiple undirected graph. Followed by a few even in the form of a string of data input from the keyboard. Such as: (A, B) from the initial node (the data field of the value of an uppercase letter A), to the end node (the data field of the value of an uppercase letter B), without the side . Last input (Z, Z) represents the input end.