General Musing

Using the Tag Surfer feature I saw this article The LinkedIn Algorithm, the writer wonders how the algorithm would work. Having the advantage of 4042 connections I checked out a number of the people who might be people I know and saw that the lowest connection count was over 400 and the highest close to 1500, the mean being round 700. All these people were 2nd level contacts, so this could easily be done with a BFS (breadth-first search).

For the deeper searches, how I’m connected, I think it’s more likely to be something like Dijkstra’s algorithm.

technorati tags: BFS, DFS, dijkstra, algorithm, computer, science, mathmatics, statistics