			iIfWc2AQusxPgvq484vH2eUgtpYHH0Hteeqb75ZwMQ+j+cDg9PlwFDwd6o9sr0KtbWI/tSPgp32M
				76H+s6mNX3030df5neGq1OtbZDUbOIlFoFaha0L9j0qfCHeAerDqVtODU8+hNThZfR1fHHbpG6kx
				9Or1LzUmVVz+HJXDAAAAAElFTkSuQmCC">
		<h1 class="title">Intel&reg; Threading Building Blocks.<br>Shortpath sample</h1>
	</div>
	
	<p>
		This directory contains a simple example that solves the single source
		shortest path problem.
	<br><br>
		It is parameterized by N, a number of nodes, and a start and end node in [0..N). 
		A graph is generated