graph's diameter is the largest number of vertices which must be 
traversed in order to travel from one vertex to another when paths which 
backtrack, detour, or loop are excluded from consideration. 
 
DIAM  - the diameter 
RAD   - the radius 
 
Systems Biology and Evolution Toolbox (SBEToolbox). 
Authors: James Cai, Kranti Konganti. 
(C) Texas A&M University. 
 
$LastChangedDate: 2012-07-25 15:41:42 -0500 (Wed, 25 Jul 2012) $ 
$LastChangedRevision: 215 $ 
$LastChangedBy: konganti $