Find the center node on a weighted, non-directed graph
Use the Floyd-Warshall algorithm to compute all-pairs shortest paths (i.e., compute the distance between each pair of nodes).  Then it is easy to find the center of the graph by enumerating all possibilities for the center node.  The running time will be $O(n^3)$.