[Cs4800] HW 2 question

[Karl Lieberherr]

Hi Mike:

the maximum distance between any pair of nodes is indeed 7 in the graph we
used. v1-u6-u5-u4-u3-u2-u1-v2
length 7.

-- Karl

On Mon, Jan 25, 2010 at 11:44 AM, Michael Quintin <quintin at ccs.neu.edu>wrote:

>  Hi, quick question to clarify problem 8: In class we decided that the
> diameter of a graph that had the cycle u1-u2-u3-u4-u5-u6-v1-u1 was 7, but
> the book defines *diameter* as the longest *distance* between two nodes,
> and *distance* is defined as the *shortest* path. So would the diameter of
> the graph in class have really been 4, since u4-u3-u2-u1-vx and
> u5-u6-v1-u1-vx are the longest distances?
>
> Thanks,
> -Mike Quintin
>
-------------- next part --------------
HTML attachment scrubbed and removed