  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.
