I am looking for an algorithm that, given a large weighted undirected graph, would find the node that has minimum average distance from a given set of nodes in the graph.
Finding the nearest node to a given set of nodes in a graph
ds.algorithms;graph theory;graph algorithms