Post on 20-Dec-2015
transcript
1
2 3
65
4
1
2 3
65
4
1
2 3
65
4
1
2 3
65
4
1
2 3
65
4
1
2 3
65
4
1
2 3
65
4
1
3
6
{2,4,5}
1
3
6
{2,4,5}
1
3
6
{2,4,5}
1
3
6
{2,4,5}
1
3
6
{2,4,5}
1
6
{2,4,5}
1
6
{2,4,5}
1
6
{2,4,5}
1
{2,4,5,6}
1
{2,4,5,6}
1
1
1
2 3
65
4
1
2
4
1
2 3
65
4
1
2
4
1
2 3
65
4
1
2
4
5
1
2 3
65
4
1
2
4
5
1
2 3
65
4
1
2
4
5
1
2 3
65
4
1
2
4
5
1
2 3
65
4
1
2
4
5
1
2 3
65
4
1
2
4
5
1
3
6
{2,4,5}
1
2
4
5
1
3
6
{2,4,5}
1
2
4
5
1
3
6
{2,4,5}
1
2
4
5
6
1
6
{2,4,5}
1
2
4
5
6
1
6
{2,4,5}
1
2
4
5
6
1
6
{2,4,5}
1
2
4
5
6
1
6
{2,4,5}
1
2
4
5
6
1
{2,4,5,6}1
2
4
5
6
Multi-pass Strong Component Algorithm
DFS Timings
0
5
10
15
torus grid dense acyclic
Random Graphs, 200K-600K Edges
Ave
. Tim
e, 2
0 g
raph
s
Path
LOWPT
twopass
DFS Timings
0
0.05
0.1
0.15
0.2
torus grid dense acyclic
Random Graphs, 200K-600K Edges
Ave
. Tim
e, 2
0 G
raph
s
Path
LOWPT
1972 – Tarjan’s strong component algorithm