efined</h3>

<a href="../../../boost/graph/dag_shortest_paths.hpp"><tt>boost/graph/dag_shortest_paths.hpp</tt></a>

<h3>Parameters</h3>

IN: <tt>const VertexListGraph&amp; g</tt> 
<blockquote>
  The graph object on which the algorithm will be applied.
  The type <tt>VertexListGraph</tt> must be a model of \concept{VertexListGraph}.
</blockquote>

IN: <tt>vertex_descriptor s</tt> 
<blockquote>
  The source vertex. All distance will be calculated from this vertex,
  and the shortest paths tree will be rooted 