**fig9_18.txt**

/* 1*/	void			// T is initialized ( Fig 9.30 ).
/* 2*/	Unweighted( Table T )
/* 3*/	{
/* 4*/	    Vertex V, W;
/* 5*/	    Queue<Vertex> Q( Num_Vertex );

/* 6*/	    Q.Enqueue( S ); // Enqueue the start vertex S, determined elsewhere.

/* 7*/	    while( ! Q.Is_Empty( ) )
/* 8*/	    {
/* 9*/	        V = Q.Dequeue( );
/*10*/	        T[ V ].Known = TRUE;	// Not really needed anymore.
/*11*/	        for Each W Adjacent To V
/*12*/	            if( T[ W ].Dist == Infinity )
/*13*/	            {
/*14*/	                T[ W ].Dist = T[ V ].Dist;
/*15*/	                T[ W ].Path = V;
/*16*/	                Q.Enqueue( W );
/*17*/	            }
/*18*/	    }
/*19*/	}