Friendship Network Mining

[BradKML]

It is seen that this can be used to construct an ego graph of one degree. https://github.com/Altimis/Scweet/blob/master/Scweet/user.py
For having it in multiple degrees, one has to merely create a "checked" flag and a depth counter for BFS.
However it can have more than one "seed", thus increasing complexity. I wonder if there is a way to cache this data easily and not have conflicted depth counts between starting points.

It could be used in projects like this:

• https://github.com/eleurent/twitter-graph
• https://github.com/pournaki/twitter-explorer
• https://github.com/flaprimo/twitter-network-analysis
• https://github.com/chandnii7/Social-Network-Analysis