DSAug 2, 2020
On Frink's type metrization of weighted graphsMaría Florencia Acosta, Hugo Aimar, Ivana Gómez
Using the technique of the metrization theorem of uniformities with countable bases, in this note we provide, test and compare an explicit algorithm to produce a metric $d(x,y)$ between the vertices $x$ and $y$ of an affinity weighted undirected graph.