Hi every body,
I am looking for your help to inform me about the existence of algorithm (article) in graph theory which computes the best (minimum of paths cost) vertex that is connected to a subset of vertices.
In other words, my input is a set of nodes (vertices) in a weighted graph, and I am searching the vertex that minimises the cost of its paths to each one of the initial subset of nodes.
I am hoping to get your help sooner.
Best reagrds
I am looking for your help to inform me about the existence of algorithm (article) in graph theory which computes the best (minimum of paths cost) vertex that is connected to a subset of vertices.
In other words, my input is a set of nodes (vertices) in a weighted graph, and I am searching the vertex that minimises the cost of its paths to each one of the initial subset of nodes.
I am hoping to get your help sooner.
Best reagrds