a space-efficient algorithm for finding strongly connected components：寻找强连通分量的空间有效算法.pdfVIP

Information Processing Letters 116 (2016) 47–52 Contents lists available at ScienceDirect Information Processing Letters /locate/ipl A space-efficient algorithm for finding strongly connected components David J. Pearce School of Engineering and Computer Science, Victoria University, New Zealand a r t i c l e i n f o a b s t r a c t Article history: Tarjan’s algorithm for finding the strongly connected components of a directed graph is Received 19 March 2015 widely used and acclaimed. His original algorithm required at most v (2 + 5w ) bits of Received in revised form 25 August 2015 storage, where w is the machine’s word size, whilst Nuutila and Soisalon-Soininen reduced Accepted 31 August 2015 this to v (1 + 4w ). Many real world applications routinely operate on very large graphs Available online 9 September 2015 Communicated by Ł. Kowalik where the storage requirements of such algorithms is a concern. We present a novel improvement on Tarjan’s algorithm which reduces the space requirements to v (1 + 3w ) Keywords: bits in the worst case. Furthermore, our algorithm has been independently integrated into Graph algorithms the widely-used SciPy library for scientific computing. Strongly connected components