raits.hpp&gt;
  #include &lt;boost/graph/adjacency_list.hpp&gt;
  #include &lt;boost/graph/dijkstra_shortest_paths.hpp&gt;

  using namespace boost;
  
  int main(int,char*[])
  {
    // create a typedef for the Graph type
    typedef adjacency_list&lt;vecS, vecS, bidirectionalS&gt; Graph;

    // Make convenient labels for the vertices
    enum { A, B, C, D, E, N };
    const int num_vertices = N;
    const char* name = "ABCDE";

    // writing out the edges in the graph
    typedef std::pair&lt;int, int&g