The AdjacencyGraph concept provides and interface for efficient access
of the adjacent vertices to a vertex in a graph. This is quite similar
to the IncidenceGraph concept (the
target of an out-edge is an adjacent vertex). Both concepts are
provided because in some contexts there is only concern for the
vertices, whereas in other contexts the edges are also important.
Объект типаboost::graph_traits::vertex_descriptor.
Associated Types
boost::graph_traits::traversal_category
Этот тип тега должен быть конвертируемым вadjacency_graph_tag.
<
boost::graph_traits<G>::adjacency_iterator
>Итератор смежности для вершиныvобеспечивает доступ к вершинам, прилегающим кv. Таким образом, тип значения итератора смежности является типом дескриптора вершины его графика. Итератор смежности должен соответствовать требованиямMultiPassInputIterator.
The AdjacencyGraph concept is somewhat frivolous since IncidenceGraph really covers the same
functionality (and more). The AdjacencyGraph concept exists because
there are situations when adjacent_vertices() is more
convenient to use than out_edges(). If you are constructing a
graph class and do not want to put in the extra work of creating an
adjacency iterator, have no fear. There is an adaptor class named adjacency_iterator that
you can use to create an adjacency iterator out of an out-edge
iterator.
Notes
[1] The case of a
multigraph (where multiple edges can connect the same two
vertices) brings up an issue as to whether the iterators returned by
the adjacent_vertices() function access a range that
includes each adjacent vertex once, or whether it should match the
behavior of the out_edges() function, and access a
range that may include an adjacent vertex more than once. For now the
behavior is defined to match that of out_edges(),
though this decision may need to be reviewed in light of more
experience with graph algorithm implementations.
