Information Feedback in Temporal Networks as a Predictor of Market Crashes

Algorithm 1. Tarjan’s Strongly Connected Component Algorithm.

1: procedure TARJAN

2:   new empty stack

3:     // list of strongly connected components

4:  

5:  for do

6:   if is not defined then   // has not been visited

7:    BUILDTREE()

8: procedure BUILDTREE()

9:    

10:     //index of a visited node is the current counter

   value

11:     //initialize the smallest index of an accessible node to its own index

12:  push to

13:  for neighbors of do

14:   if is undefined then   // has not been visited

15:    BUILDTREE()

16:    

17:   else if is on then   // has been visited but it is in the current component

18:    

19:  if then   // is a root of the component

20:      //create new empty SCC

21:   repeat

22:     top of

23:    add to

24:    pop top from

25:   until

26:   add to    //add the new SCC to the list of SCCs

Algorithm 1. Tarjan’s Strongly Connected Component Algorithm.