java graph 数据结构_数据结构图-JAVA实现

package com.sunny.graph.matrix;

public class Graph {

private int vertexSize;//顶点数量

private int [] vertexs;//顶点数组

private int[][] matrix;//邻接矩阵

private final static int MAX_WEIGHT = 1000;//权值即图的无穷大。这里只是做了最大的定义

public Graph(int vertexSize) {

super();

this.vertexSize = vertexSize;

matrix = new int[vertexSize][vertexSize];

vertexs = new int[vertexSize];

for (int i = 0; i < vertexSize; i++) {

vertexs[i] = i;

}

}

public int[] getVertexs() {

return vertexs;

}

public void setVertexs(int[] vertexs) {

this.vertexs = vertexs;

}

/**

* 计算顶点的出度 横排是出度，竖列是入度

* */

public int getOutDegree(int index){

int degree = 0;

for (int j = 0; j <