extracting information about people based on how they manage their fb profile
- find the most connected person
- within the graphpool, see the level of exclusiveness (number of terminal ends, no friends exposed)
- number of open nodes – can see all of their info
- its a tree structure but how many connections to back up the tree?
admin 3:12 am on December 5, 2009 Permalink
perhaps FBSpy as working name.
recurse, fine, end condition (too deep) but how to handle cycles? DAGs?