arXiv:2505.06405v3 Announce Type: replace-cross Abstract: Let $(X_1,d_1),\dots,(X_N,d_N)$ be metric spaces with $d_i:X_i\times X_i\to[0,1]$ and let $X=\prod_{i=1}^N X_i$. Let $G$ be a directed graph with vertex set $[N]=\{1,\dots,N\}$ and edge set $E(G)$. Given edge weights $P=\{p_{ij}\in(0,1]:(i,j)\in E(G)\}$, define the closed in-neighborhood $B_j(G):=\{j\}\cup\{i:(i,j)\in E(G)\}$ and put $p_{jj}=1$. Define, for $g,h\in X$, \[ d_{X,G,P}(g,h)\;:=\;1-\frac{1}{N}\sum_{j=1}^N\ \prod_{i\in B_j(G)}\bigl(1-d_i(g_i,h_i)\bigr)^{1/p_{ij}}. \] We prove that $d_{X,G,P}$ is a metric and analyze its behavior under graph operations (disjoint unions, Cartesian products). Two quantitative principles govern this family: (i) \emph{edge densification} (adding edges) increases the distance pointwise and in expectation, with an exact single-edge increment formula and a uniform $1/N$ sensitivity bound; and (ii) \emph{weight monotonicity}: increasing an edge weight $p_{ij}$ decreases the metric. When the coordinate pairs are independent across coordinates, we obtain a closed-form factorization of the mean distance.} In the discrete specialization $X=\mathbb{F}_q^N$ with $d_i\in\{0,1\}$ and $G$ acyclic, after replacing $G$ by the oriented reflexive transitive closure $G^{\preceq}$ of Corollary~1.4, the unnormalized distance $D_{X,G^{\preceq},P}:=N d_{X,G^{\preceq},P}$ coincides with the size of the hereditary closure of the support, yielding a poset/digraph \emph{sphere-packing bound} via the counting of lower ideals. Finally, we give a continuous analog of the construction, yielding a metric on $C([0,1],\mathbb C)$ through an explicit integral formula. These results unify and generalize several graph-based metrics used in coding theory while providing new design levers for mean-distance control.