3 Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
5 Distributed under the Boost Software License, Version 1.0.
6 (See accompanying file LICENSE_1_0.txt or copy at
7 http://www.boost.org/LICENSE_1_0.txt)
10 <Title>Boost Graph Library: Graph Traits
</Title>
11 <BODY BGCOLOR=
"#ffffff" LINK=
"#0000ee" TEXT=
"#000000" VLINK=
"#551a8b"
13 <IMG SRC=
"../../../boost.png"
14 ALT=
"C++ Boost" width=
"277" height=
"86">
20 adjacency_list_traits
<EdgeList, VertexList, Directed
>
24 This class provides an alternate method for accessing some of the
25 associated types of the
<tt>adjacency_list
</tt> class. The main reason
26 for this class is that sometimes one would like to create graph
27 properties whose values are vertex or edge descriptors. If you try to
28 use
<tt>graph_traits
</tt> for this you will run into a problem with
29 mutually recursive types. To get around this problem, the
30 <tt>adjacency_list_traits
</tt> class is provided, which gives the user
31 access to the vertex and edge descriptor types without requiring the
32 user to provide the property types for the graph.
35 template
<class EdgeList, class VertexList, class Directed
>
36 struct adjacency_list_traits {
37 typedef ... vertex_descriptor;
38 typedef ... edge_descriptor;
39 typedef ... directed_category;
40 typedef ... edge_parallel_category;
44 <h3>Where Defined
</h3>
46 <a href=
"../../../boost/graph/adjacency_list.hpp"><tt>boost/graph/adjacency_list.hpp
</tt></a>
48 <H3>Template Parameters
</H3>
53 <th>Parameter
</th><th>Description
</th><th>Default
</th>
56 <TR><TD><TT>EdgeList
</TT></TD>
58 The selector type for the edge container implementation.
60 <td><tt>vecS
</tt></td>
63 <TR><TD><TT>VertexList
</TT></TD>
65 The selector type for the vertex container implementation.
67 <td><tt>vecS
</tt></td>
70 <TR><TD><TT>Directed
</TT></TD>
72 The selector type whether the graph is directed or undirected.
74 <td><tt>directedS
</tt></td>
82 href=
"http://www.sgi.com/tech/stl/DefaultConstructible.html">DefaultConstructible
</a> and
83 <a href=
"http://www.sgi.com/tech/stl/Assignable.html">Assignable
</a>
85 <h3>Type Requirements
</h3>
95 <th>Member
</th><th>Description
</th>
103 The type for the objects used to identify vertices in the graph.
112 The type for the objects used to identify edges in the graph.
121 This says whether the graph is undirected (
<tt>undirected_tag
</tt>)
122 or directed (
<tt>directed_tag
</tt>).
128 edge_parallel_category
131 This says whether the graph allows parallel edges to be inserted
132 (
<tt>allow_parallel_edge_tag
</tt>) or if it automatically removes
133 parallel edges (
<tt>disallow_parallel_edge_tag
</tt>).
141 <a href=
"./adjacency_list.html"><tt>adjacency_list
</tt></a>
147 <TD nowrap
>Copyright
© 2000-
2001</TD><TD>
148 <A HREF=
"http://www.boost.org/people/jeremy_siek.htm">Jeremy Siek
</A>,
149 Indiana University (
<A
150 HREF=
"mailto:jsiek@osl.iu.edu">jsiek@osl.iu.edu
</A>)
<br>
151 <A HREF=
"http://www.boost.org/people/liequan_lee.htm">Lie-Quan Lee
</A>, Indiana University (
<A HREF=
"mailto:llee@cs.indiana.edu">llee@cs.indiana.edu
</A>)
<br>
152 <A HREF=
"http://www.osl.iu.edu/~lums">Andrew Lumsdaine
</A>,
153 Indiana University (
<A
154 HREF=
"mailto:lums@osl.iu.edu">lums@osl.iu.edu
</A>)