## Efficient algorithm to find 2-step neighbors for all vertices in a directed graph

I have a large directed graph in csv format (~14GB) of edges represented as integers in the following format:
node1,node2
3213741,23521361
3213741,6532710
3213741,12340611
3213741,6457392
3213741,9682135
6567133,12956771
6567133,23860123
node1 is ...

more
»