ng the BGL. Here we will take a quick look at the implementation
and use of the predecessor recorder. Since we will be using the <a href="dijkstra_shortest_paths.html">dijkstra_shortest_paths()</a>
algorithm, the visitor we create must be a <a href="DijkstraVisitor.html">Dijkstra Visitor</a>.
<p>The functionality of the <tt>record_predecessors</tt> visitor is separated
into two parts. For the storage and access of the predecessor property, we will
use a <a href="../../property_map/doc/property_map.html">pro