Comments on: How do social networking sites calculate if you are within a certain degree of separation efficiently? http://usbappz.com/2009/12/how-do-social-networking-sites-calculate-if-you-are-within-a-certain-degree-of-separation-efficiently/ put it on a USB Flash Drive Thu, 04 Aug 2011 07:02:20 +0000 hourly 1 http://wordpress.org/?v=3.3.1 By: codywodyboy http://usbappz.com/2009/12/how-do-social-networking-sites-calculate-if-you-are-within-a-certain-degree-of-separation-efficiently/comment-page-1/#comment-84360 codywodyboy Tue, 15 Dec 2009 04:27:21 +0000 http://usbappz.com/2009/12/how-do-social-networking-sites-calculate-if-you-are-within-a-certain-degree-of-separation-efficiently/#comment-84360 i'm not sure http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm i’m not sure

http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

Report this comment

]]> By: gstoll2003 http://usbappz.com/2009/12/how-do-social-networking-sites-calculate-if-you-are-within-a-certain-degree-of-separation-efficiently/comment-page-1/#comment-84358 gstoll2003 Tue, 15 Dec 2009 03:29:37 +0000 http://usbappz.com/2009/12/how-do-social-networking-sites-calculate-if-you-are-within-a-certain-degree-of-separation-efficiently/#comment-84358 You can view the structure of these friends relationships as a graph - each person is a node, and there is an edge between two nodes if those two people are friends. Therefore, this problem is reduced to finding all nodes that are of distance three or less from the given node. Dijkstra's algorithm (link below) is a clever algorithm that can be used to solve this in not too much time. http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm You can view the structure of these friends relationships as a graph – each person is a node, and there is an edge between two nodes if those two people are friends. Therefore, this problem is reduced to finding all nodes that are of distance three or less from the given node. Dijkstra’s algorithm (link below) is a clever algorithm that can be used to solve this in not too much time.

http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

Report this comment

]]>