clean up some function names;
convert adjacency information to an array of arrays;
find indices of leaf nodes (graph.leafIndices);
compute array of distances from nodes to leaves (graph.leafDistance).
pick a central node based upon maximum distance to any leaf node.
clean up some lint warnings.