图的实现由Graph类完成。类中，图数据结构采用邻接

　　表实现。邻接链表中的节点用一个数据对表示，第一个域

　　用来保存和连接第i个节点边的另一端的节点编号，第二个

　　域用来保存该边的权值。另外用一个辅助数组来存储各节点

　　的评分值。-Figure achieved by the Graph class is completed. Class, graph data structure using adjacency

Table implementation. Adjacency list nodes with a data representation, the first domain

To save the node i and the connection section of the other side of the node number, the second

Field is used to save the edge weights. Also with an auxiliary array to store each node

Score values.