arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.05387cs.DS
收藏

图的强连通分支算法

Strongly connected components-Algorithm for finding the strongly connected components of a graph

Vlad-Andrei Munteanu

摘要:

一个有向图G(V,E)是强连通的当且仅当对于V的一对顶点X和Y,存在一条从X到Y的路和一条从Y到X的路。在计算机科学中,图的强连通分支的划分由图的所有顶点的划分来表示,使得对于来自同一划分的任何两个顶点X和Y,存在从X到Y的路径和从Y到X的路径,并且对于来自不同划分的任何两个顶点U和V,不满足该性质。下面给出的算法是为了在O(numberOfNodes + numberOfEdges * log*(numberOfNodes))中找到给定图在强连通分量中的分区,其中log* 函数代表迭代对数。

英文摘要:

A directed graph G (V, E) is strongly connected if and only if, for a pair of vertices X and Y from V, there exists a path from X to Y and a path from Y to X. In Computer Science, the partition of a graph in strongly connected components is represented by the partition of all vertices from the graph, so that for any two vertices, X and Y, from the same partition, there exists a path from X to Y and a path from Y to X and for any two vertices, U and V, from different partition, the property is not met. The algorithm presented below is meant to find the partition of a given graph in strongly connected components in O (numberOfNodes + numberOfEdges * log* (numberOfNodes)), where log* function stands for iterated logarithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑