拓扑排序
拓扑排序是对有向无圈图的顶点的一种排序,是得如果存在一条从Vi到Vj的路劲,那么在排序中Vj就出现在Vi的后面。例如课程的学习顺序。
/**
*
* @author 陈鑫
* 图的拓扑排序
*/
public class TopologicalSorting {
static class Vertex{
public String vertexName;//点的名称
public Integer topNum;//拓扑编号
public Integer indegree;//入度
public List<Vertex> adjacentVertex;//邻接顶点
public String getVertexName() {
return vertexName;
}
public void setVertexName(String vertexName) {
this.vertexName = vertexName;
}
public Integer getTopNum() {
return topNum;
}
public void setTopNum(Integer topNum) {
this.topNum = topNum;
}
public Integer getIndegree() {
return indegree;
}
public void setIndegree(Integer indegree) {
this.indegree = indegree;
}
public List<Vertex> getAdjacentVertex() {
return adjacentVertex;
}
public void setAdjacentVertex(List<Vertex> adjacentVertex) {
this.adjacentVertex = adjacentVertex;