Abstract <p>The paper presents an implementation of an algorithm for finding graph centers. A characteristic feature of the problem statement is the lack of general information about the structure of the graph, the number of its vertices, and the number of edges incident to a particular vertex. A vertex, in this case, is a separate “entity” about which it is known how many edges are incident to it and what their weight is. The only requirements imposed on the graph are connectivity, nonnegativity of edge lengths, and their nondirectivity. The essence of the algorithm lies in the local exchange of “messages” between the graph nodes, which form the weight of each of them: a value identical to the distance from it to the most distant node of the graph.</p>