无向图的邻接表结构

package com.answer.tu;

public class ListUDG {
    private class VNode{//表的顶点
        private String data;//
        private ENode firstEdge;//指向其第一个邻接点
    }
    private class ENode{//表的邻接点
        private int tp;//邻接点在顶点数组中的索引
        private ENode nextEdge;//该顶点的下一条弧的顶点
    }
    private VNode[] top;//顶点数组
    public ListUDG(String[] vexs, String[][] edges){
        int vlen=vexs.length;
        int elen=edges.length;
        top=new VNode[vlen];
        for(int i=0;i