/tt> (see Section <a href="using_adjacency_list.html#sec:choosing-graph-type">Choosing
the <tt>Edgelist</tt> and <tt>VertexList</tt></a>). The <tt>directedS</tt> type
specifies that the graph should be directed (versus undirected). The following
code shows the specification of the graph type and then the initialization of
the graph. The edges and weights are passed to the graph constructor in the form
of iterators (a pointer qualifies as a <a href="http://www.sgi.com/tech/stl/RandomAccessIterator.html">Rand