图---邻接链表建立

package Graph;
/**使用邻接表 生成图*/
public class Graph {
 
    public int Vertex;
    public int EdgeNum;
    VNode[] graph;
    public Graph(int V[],int E, int [][]vertex,int [] weight)
    {
        this.Vertex=V.length;
        this.EdgeNum=E;
        graph=new VNode[V.length];
        CreateGraph (graph ,vertex,weight,V);
        
    }
    public void PrintGraph(VNode[]graph)
    {
        for(int i=0;i<graph.length;i++)
        {
            System.out.print(graph[i].verternum+"-->");
            PrintEdge(graph[i].firstedge);
            System.out.println();
        }
    }
    public void PrintEdge(EdgeNode p)
    {
        while(p!=null)
        {
            System.out.print("("+p.adjvex+","+p.weight+")"+"  ");
            p=p.nextedge;
        }
        
    }
    public void CreateGraph(VNode []graph,int [][]vertex,int []weight,int Vnum[])
    {
        for(int i=0;i<graph.length;i++)
        {     // 初始化邻接链表的值， 
            graph[i]=new VNode(Vnum[i]);
            
        }
        
        for(int i=0;i<weight.length;i++)
        {
            
            for(int j=0;j<graph.length;j++)
            {
                if(vertex[i][0]==graph[j].verternum)
                {
                    addEdge(graph[j],vertex[i][1],weight[i]);
                }
            }
        }
        
    }
    
    public void addEdge(VNode vertex ,int adj,int weight)
    {
        /**
         * 功能： 在邻接表后面增加边*/
        if(vertex.firstedge==null)
        {
            vertex.firstedge=new EdgeNode(adj,weight);
        }
        else
        {
            EdgeNode phead=vertex.firstedge;
            while(phead.nextedge!=null)
            {
                phead=phead.nextedge;
            }
            phead.nextedge=new EdgeNode(adj,weight);
        }
    
    }
    public static void main(String [] args)
    {
        int [][]array={{1,2},{1,3},{1,4},{2,4},{2,3},{3,4}};
        int weight[]={1,2,3,4,5,6};
        int []vNum={1,2,3,4};
        Graph graph=new Graph(vNum,weight.length,array,weight);
        graph.PrintGraph(graph.graph);
    }
}
class VNode
{
    /**
     * 顶点的信息*/
    int verternum;
    EdgeNode firstedge=null;
    public VNode(int v)
    {
        this.verternum=v;
    }

}
class EdgeNode
{
    /**
     *邻接表定义 */
    int adjvex;//顶点的编号
    int weight;
    EdgeNode nextedge=null;
    // 无权图
    public EdgeNode(int adj)
    {
        this.adjvex=adj;
        this.weight=1;
        
    }
//有权图
    public EdgeNode(int adj,int wt)
    {
        this.adjvex=adj;
        this.weight=wt;
        
    }
}

结果显示
1-->(2,1)  (3,2)  (4,3)  
2-->(4,4)  (3,5)  
3-->(4,6)  
4-->