xample, we construct a graph and apply <a href="dijkstra_shortest_paths.html"><tt>dijkstra_shortest_paths()</tt></a>.
The complete source code for the example is in <a href="../example/dijkstra-example.cpp"><tt>examples/dijkstra-example.cpp</tt></a>.
Dijkstra's algorithm computes the shortest distance from the starting vertex to
every other vertex in the graph.
<p>Dijkstra's algorithm requires that a weight property is associated with each
edge and a distance property with each vertex. Here we use an intern