******** fig9.31 **********

	/* print shortest path to v after dijkstra has run */
	/* assume that the path exists */

	void
	print_path( vertex v, TABLE T )
	{
		if( T[v].path != NOT_A_VERTEX )
		{
			print_path( T[v].path, T );
			printf(" to ");
		}
		printf("%v", v );	/* %v is a pseudocode option for printf */
	}