FINALLY!!! Even mathematica 8 failed on 69 Mb adjacency list!
I have written a C++ program, which computes 5 most greater strongly connected components in graph. And it works extremely fast!!! ~800000 vertices and only 4.7 seconds for file loading and all computations. I'm HAPPY!!!
D:\stanford\algo-class\SCC\Release>powershell -Command Measure-Command { ./SCC.exe ../SCC.txt }
Days : 0
Hours : 0
Minutes : 0
Seconds : 4
Milliseconds : 695
Ticks : 46957370
TotalDays : 5.43488078703704E-05
TotalHours : 0.00130437138888889
TotalMinutes : 0.0782622833333333
TotalSeconds : 4.695737
TotalMilliseconds : 4695.737
Comments