******** fig9.16 **********

	void
	unweighted( TABLE T )	/* assume T is initialized */
	{
		unsigned int curr_dist;
		vertex v, w;

/*1*/		for( curr_dist=0; curr_dist < NUM_VERTEX; curr_dist++ )
/*2*/			for each vertex v
/*3*/				if( (!T[v].known) && (T[v].dist == curr_dist) )
				{
/*4*/					T[v].known = TRUE;
/*5*/					for each w adjacent to v
/*6*/						if( T[w].dist == INT_MAX )
						{
/*7*/							T[w].dist = curr_dist + 1;
/*8*/							T[w].path = v;
						}
				}
	}