import java.util.ArrayList;
import java.util.LinkedList;
/**
 * @description 鄰接矩陣模型類
 * @author beanlam
 * @time 2015.4.17 
 */
public class AMWGraph {
  private ArrayList vertexList;//存儲(chǔ)點(diǎn)的鏈表
  private int[][] edges;//鄰接矩陣，用來存儲(chǔ)邊
  private int numOfEdges;//邊的數(shù)目

  public AMWGraph(int n) {
    //初始化矩陣，一維數(shù)組，和邊的數(shù)目
    edges=new int[n][n];
    vertexList=new ArrayList(n);
    numOfEdges=0;
  }

  //得到結(jié)點(diǎn)的個(gè)數(shù)
  public int getNumOfVertex() {
    return vertexList.size();
  }

  //得到邊的數(shù)目
  public int getNumOfEdges() {
    return numOfEdges;
  }

  //返回結(jié)點(diǎn)i的數(shù)據(jù)
  public Object getValueByIndex(int i) {
    return vertexList.get(i);
  }

  //返回v1,v2的權(quán)值
  public int getWeight(int v1,int v2) {
    return edges[v1][v2];
  }

  //插入結(jié)點(diǎn)
  public void insertVertex(Object vertex) {
    vertexList.add(vertexList.size(),vertex);
  }

  //插入結(jié)點(diǎn)
  public void insertEdge(int v1,int v2,int weight) {
    edges[v1][v2]=weight;
    numOfEdges++;
  }

  //刪除結(jié)點(diǎn)
  public void deleteEdge(int v1,int v2) {
    edges[v1][v2]=0;
    numOfEdges--;
  }

  //得到第一個(gè)鄰接結(jié)點(diǎn)的下標(biāo)
  public int getFirstNeighbor(int index) {
    for(int j=0;j<vertexList.size();j++) {
      if (edges[index][j]>0) {
        return j;
      }
    }
    return -1;
  }

  //根據(jù)前一個(gè)鄰接結(jié)點(diǎn)的下標(biāo)來取得下一個(gè)鄰接結(jié)點(diǎn)
  public int getNextNeighbor(int v1,int v2) {
    for (int j=v2+1;j<vertexList.size();j++) {
      if (edges[v1][j]>0) {
        return j;
      }
    }
    return -1;
  }
}

/**
 * @description AMWGraph類的測試類
 * @author beanlam
 * @time 2015.4.17
 */
public class TestAMWGraph {
  public static void main(String args[]) {
    int n=4,e=4;//分別代表結(jié)點(diǎn)個(gè)數(shù)和邊的數(shù)目
    String labels[]={"V1","V1","V3","V4"};//結(jié)點(diǎn)的標(biāo)識(shí)
    AMWGraph graph=new AMWGraph(n);
    for(String label:labels) {
      graph.insertVertex(label);//插入結(jié)點(diǎn)
    }
    //插入四條邊
    graph.insertEdge(0, 1, 2);
    graph.insertEdge(0, 2, 5);
    graph.insertEdge(2, 3, 8);
    graph.insertEdge(3, 0, 7);

    System.out.println("結(jié)點(diǎn)個(gè)數(shù)是："+graph.getNumOfVertex());
    System.out.println("邊的個(gè)數(shù)是："+graph.getNumOfEdges());

    graph.deleteEdge(0, 1);//刪除<V1,V2>邊
    System.out.println("刪除<V1,V2>邊后...");
    System.out.println("結(jié)點(diǎn)個(gè)數(shù)是："+graph.getNumOfVertex());
    System.out.println("邊的個(gè)數(shù)是："+graph.getNumOfEdges());
  }
}