**fig9_31.txt**

/* 1*/	// Print shortest path to vertex V,
/* 2*/	// After procedure Dijkstra has run.
/* 3*/	// Assume that the path exists.

/* 4*/	void
/* 5*/	Print_Path( Vertex V, Table T )
/* 6*/	{
/* 7*/	    if( T[ V ].Path != Not_A_Vertex )
/* 8*/	    {
/* 9*/	        Print_Path( T[ V ].Path, T );
/*10*/	        cout << " to ";
/*11*/	    }
/*12*/	    cout << V;
/*13*/	}