Module org.jgrapht.core
Package org.jgrapht.alg.interfaces

Interface CentersLocationAlgorithm<V,E>

Type Parameters:
V - the graph vertex type
E - the graph edge type
All Known Implementing Classes:
CentersLocationAlgorithmBase, GonHeuristic
public interface CentersLocationAlgorithm<V,E>
An algorithm for solving the vertex $k$-center problem.

Center location problems are a class of optimization problems in graph theory and operations research that aims selecting optimal locations for facilities (centers) to minimize the distance or cost for serving a set of demand points or clients (vertices) in a graph.

Author:
Jose Alejandro Cornejo-Acosta

  • Method Summary

    Modifier and Type
    Method
    Description
    Set<V>
    getCenters(Graph<V,E> graph, int k)
    Computes a set of centers.

  • Method Details

    • getCenters

      Set<V> getCenters(Graph<V,E> graph, int k)
      Computes a set of centers.
      Parameters:
      graph - the input graph.
      k - the number of centers to locate.
      Returns:
      a set of centes.