Date: Tue, 13 Aug 2002 11:14:41 -0700 (PDT)
From: Hannah C. Tang <hctang@cs.washington.edu>
Subject: Re: node identifier

First, you can assume that the node identifier is an integer (it says so 
in the comments).  Second, (and I got this wrong yesterday), you *cannot* 
assume that these id's are sequential.

So, if the following were our input file:
  cse326Graph-v1.0
  3 4

  1 Brian
  2 Hannah
  6 Albert
  
  (1, 2) 1 # It's easy for Brian to talk to Hannah
  (2, 6) 10 # It's hard for Hannah to talk to Albert
  (6, 1) 4 # Albert has no problem talking to Brian
  (1, 6) 3 # And Brian has no problem talking with Albert

  $

We would have the following graph:

           1           10
    Brian ---> Hannah ---> Albert
    |   ^        4         |    ^
    |   |-------------------    |
    |                           |
    |---------------------------
                 3

Hope this clears things up.  Let me know if you have any more questions

Hannah


-- 
There are 10 people in the world:
those that know binary, and those that don't.
	- Anonymous