A new metric for quantifying pairwise vertex connectivity in graphs is defined and an implementation presented. While general in nature, it features a combination of input features well-suited for social networks, including applicability to directed or undirected graphs, weighted edges, and computes using the impact from all-paths between the vertices. Moreover, the $O(V+E)$ method is applicable to large graphs. Comparisons with other techniques are included.

翻译：在图表中,界定并介绍了一种用于量化双向顶点连接的新指标,该指标虽然具有一般性质,但具有适合社交网络的组合输入特征,包括适用于定向或非定向图形、加权边缘,以及使用顶点之间全方位影响进行计算。此外,$O(V+E)的方法适用于大图,包括与其他技术的比较。