我怎么能证明与QUOT;六度＆QUOT的;概念编程？ [英] How can I prove the "Six Degrees of Separation" concept programmatically?

问题描述

我有2000万用户和连接的那些人之间的数据库。我如何证明六度分离概念的的概念，以最有效的方式编程？

文章约六度分隔理论

链接>

解决方案

您只是想衡量直径图形。 这也正是度量，找出最间隔地连接节点之间的分离中的曲线图。

很多关于谷歌的算法，升压图表了。

I have a database of 20 million users and connections between those people. How can I prove the concept of "Six degrees of separation" concept in the most efficient way in programming?

link to the article about Six degrees of separation

解决方案

You just want to measure the diameter of the graph. This is exactly the metric to find out the seperation between the most-distantly-connected nodes in a graph.

Lots of algorithms on Google, Boost graph too.

这篇关于我怎么能证明与QUOT;六度＆QUOT的;概念编程？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！