Analysis of Strongly Connected Components (SCC) Using Dynamic Graph Representation
Saleh M. Alshomrani, Gulraiz Iqbal, Saudi Arabia · 2012
Graphs are the basis of many real life applications. In our research we compare and analyse strongly connected components algorithm by using general techniques for efficient implementation. This experimental procedure exemplify in two contexts. 1. Comparison of strongly connected components algorithms. 2. Analysis of particular algorithm. Such a practice will enable java programmers, especially for those who work on such algorithms to use them efficiently. In this paper we described algorithms implementation, test and benchmark to experiment the performance of algorithms. During experimenting we found some interesting results as Cheriyan-Mehlhorn-Gabow algorithm outperform then Tarjan's algorithm