Boost logo

Boost Users :

From: Douglas Gregor (doug.gregor_at_[hidden])
Date: 2005-03-17 23:10:24


On Mar 17, 2005, at 6:58 PM, Sachin Ahuja wrote:

> Hi all:
>
> Is it possible to access the container type that
> represents the edge-list of a graph.
>
> That is, if a graph type is like so:
> typedef adjacency_list< vecS, vecS,
> bidirectionalS > graph_type;
> then, is it possible to do write something like this:
> typedef typename graph_type::EdgeListContainer
> EdgeListC;
>
> Ditto for the container type that represents the
> vertex set of a graph.

It is not possible to access this information in an adjacency_list
right now, although we can easily add the typedefs. However, the
element types of these containers are implementation details, so I'm
not quite sure how much useful information you'll actually get from the
typedefs.

        Doug


Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net