Center and Median of a Graph

For the given "weighted" adjacency matrix, draw the weighted graph G and find the following values:
  1. the distance of each vertex;
  2. the eccentricity of each vertex.
Next, compute values for the:
  1. the radius of G; rad(G) =
  2. the diameter of G. diam(G) =
Finally, compute values for the:
  1. the center of G; and C(G) =
  2. the median of G. M(G) =
eccentricity: 8 7                  
distance: 47 38                  
vertex:  a   b   c   d   e   f   g   h   i   j   k 
a   1                  
b 1   1 2              
c   1     3            
d   2     1 2 3        
e     3 1     2   1    
f       2     1        
g       3 2 1   3 4 1  
h             3     2  
I         1   4     1 2
j             1 2 1    
k                 2    


By Jack Tompkins