public class DnGraphTopologic {private int numVertexes;private VertexNode[] adjList;// 邻接顶点的一维数组public DnGraphTopologic(int numVertexes) {this.numVertexes = numVertexes;}private void createGraph() {VertexNode node0 = new VertexNode(0, "v0");VertexNode node1 = new VertexNode(0, "v1");VertexNode node2 = new VertexNode(2, "v2");VertexNode node3 = new VertexNode(0, "v3");VertexNode node4 = new VertexNode(2, "v4");VertexNode node5 = new VertexNode(3, "v5");VertexNode node6 = new VertexNode(1, "v6");VertexNode node7 = new VertexNode(2, "v7");VertexNode node8 = new VertexNode(2, "v8");VertexNode node9 = new VertexNode(1, "v9");VertexNode node10 = new VertexNode(1, "v10");VertexNode node11 = new VertexNode(2, "v11");VertexNode node12 = new VertexNode(1, "v12");VertexNode node13 = new VertexNode(2, "v13");adjList = new VertexNode[numVertexes];adjList[0] = node0;adjList[1] = node1;adjList[2] = node2;adjList[3] = node3;adjList[4] = node4;adjList[5] = node5;adjList[6] = node6;adjList[7] = node7;adjList[8] = node8;adjList[9] = node9;adjList[10] = node10;adjList[11] = node11;adjList[12] = node12;adjList[13] = node13;node0.firstEdge = new EdgeNode(11);node0.firstEdge.next = new EdgeNode(5);node0.firstEdge.next.next = new EdgeNode(4);node1.firstEdge = new EdgeNode(8);node1.firstEdge.next = new EdgeNode(4);node1.firstEdge.next.next = new EdgeNode(2);node2.firstEdge = new EdgeNode(9);node2.firstEdge.next = new EdgeNode(6);node2.firstEdge.next.next = new EdgeNode(5);node3.firstEdge = new EdgeNode(13);node3.firstEdge.next = new EdgeNode(2);node4.firstEdge = new EdgeNode(7);node5.firstEdge = new EdgeNode(12);node5.firstEdge.next = new EdgeNode(8);node6.firstEdge = new EdgeNode(5);node8.firstEdge = new EdgeNode(7);node9.firstEdge = new EdgeNode(11);node9.firstEdge.next = new EdgeNode(10);node10.firstEdge = new EdgeNode(13);node12.firstEdge = new EdgeNode(9);EdgeNode n11 = new EdgeNode(11);EdgeNode n5 = new EdgeNode(5);EdgeNode n4 = new EdgeNode(4);EdgeNode n8 = new EdgeNode(8);EdgeNode n2 = new EdgeNode(2);EdgeNode n9 = new EdgeNode(9);EdgeNode n6 = new EdgeNode(6);EdgeNode n13 = new EdgeNode(13);EdgeNode n7 = new EdgeNode(7);EdgeNode n12 = new EdgeNode(12);EdgeNode n10 = new EdgeNode(10);/** 为啥下面不可以同一个n5多个共用？因为公用的话，会出现上面n5还有next，到了下面n5明明不应该有，但是也还是有了,* 当时我还想，如果不是同一个对象的话,那出度会不会受影响，但是我想多了，因为出度不是由n5决定的，* 而是由adjlist来决定的，这个倒是只创建了一个对象。*/// node0.firstEdge = n11;// node0.firstEdge.next = n5;// node0.firstEdge.next.next = n4;// node1.firstEdge = n8;// node1.firstEdge.next = n4;// node1.firstEdge.next.next = n2;// node2.firstEdge = n9;// node2.firstEdge.next = n6;// node2.firstEdge.next.next = n5;// node3.firstEdge = n13;// node3.firstEdge.next = n2;// node4.firstEdge = n7;// node5.firstEdge = n12;// node5.firstEdge.next = n8;// node6.firstEdge = n5;// node8.firstEdge = n7;// node9.firstEdge = n11;// node9.firstEdge.next = n10;// node10.firstEdge = n13;// node12.firstEdge = n9;}/*** 拓扑排序* * @author Administrator* @throws Exception* */private void topologicalSort() throws Exception {Stack<Integer> stack = new Stack<>();int count = 0;int k = 0;// 开头就先把入度为0的vertexNode压栈（如果没有，就代表有回环）for (int i = 0; i < numVertexes; i++) {if (adjList[i].in == 0) {stack.push(i);}}while (stack.size() > 0) {// 取出栈中的下标值int pop = stack.pop();System.out.println("访问到：" + adjList[pop].data);count++;// 判断该顶点的其他出度对应的顶点是否无入度了，没有的话打印for (EdgeNode node = adjList[pop].firstEdge; node != null; node = node.next) {if (--adjList[node.getAdjVert()].in == 0) {// 证明该顶点没有了入度，可以压栈stack.push(node.getAdjVert());}}}if (count < numVertexes) {throw new Exception("完犊子了，拓扑排序失败");}}// 边表顶点class EdgeNode {private int adjVert;private EdgeNode next;private int weight;public EdgeNode(int adjVert) {this.adjVert = adjVert;}public int getAdjVert() {return adjVert;}public void setAdjVert(int adjVert) {this.adjVert = adjVert;}public EdgeNode getNext() {return next;}public void setNext(EdgeNode next) {this.next = next;}public int getWeight() {return weight;}public void setWeight(int weight) {this.weight = weight;}}// 邻接顶点class VertexNode {private int in;// 入度private String data;private EdgeNode firstEdge;public VertexNode(int in, String data) {this.in = in;this.data = data;}public int getIn() {return in;}public void setIn(int in) {this.in = in;}public String getData() {return data;}public void setData(String data) {this.data = data;}public EdgeNode getFirstEdge() {return firstEdge;}public void setFirstEdge(EdgeNode firstEdge) {this.firstEdge = firstEdge;}}public static void main(String[] args) {DnGraphTopologic dnGraphTopologic = new DnGraphTopologic(14);dnGraphTopologic.createGraph();try {dnGraphTopologic.topologicalSort();} catch (Exception e) {e.printStackTrace();}}
}