数据结构与算法–图论之寻找连通分量、强连通分量

}

public boolean stronglyConnected(int v, int w) {

return id[v] == id[w];

}

public int id(int v) {

return id[v];

}

public int count() {

return count;

}

public static void main(String[] args) {

// 边

int[][] edges = {{0, 1}, {0, 5}, {2, 3},{2, 0}, {3, 2},

{3, 5}, {4, 2}, {4, 3},{4, 5}, {5, 4}, {6, 0}, {6, 4},

{6, 9}, {7, 6}, {7, 8}, {8, 9},{8, 7}, {9, 10},

{9, 11}, {10, 12}, {11, 4}, {11, 12}, {12, 9}};

DiGraph<?> graph = new DiGraph<>(13, edges);

KosarajuSCC cc = new KosarajuSCC(graph);

// M是连通分量的个数

int M = cc.count();

System.out.println(M + "个连通分量");

LinkedList<Integer>[] components = (LinkedList<Integer>[]) new LinkedList[M];

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

components[i] = new LinkedList<>();

}

// 将同一个id的顶点归属到同一个链表中

for (int v = 0; v < graph.vertexNum(); v++) {

components[cc.id(v)].add

　　推荐阅读

　　40岁的IT巨人微软究竟是什么在支撑着它继续前进？

Tech Neo技巧沙龙 | 11月25号，九州云/ZStack与您一路商量云时代收集界线治理实践上周，微软颁布了其2018财年第一季度的财报。毫无不测埠，微软在这一季度大年夜赚了一笔。微软颁布财报后>>>详细阅读

地址：http://www.17bianji.com/lsqh/38858.html