&lt; std::endl;

  std::cout &lt;&lt; "out-edges: " &lt;&lt; std::endl;
  boost::print_graph(g, name);
  std::cout &lt;&lt; std::endl;
</pre>
The output is:
<pre>
  vertex set: A B C D E F

  edge set: (B,C) (B,F) (C,A) (C,C) (D,E) (E,D) (F,A)

  out-edges:
  A -->
  B --> C F
  C --> A C
  D --> E
  E --> D
  F --> A
</pre>

Creating the graph of <a href="#fig:undir-adj-matrix-graph">Figure 2</a>.
<pre>
  enum { A, B, C, D, E, F, N };
  const char* name = "ABCDEF";

  typedef boost::adjacency_matrix&lt;boo