Difference in adjacency_list

newer
RE: [Boost-users] Re: Bjam-...

older
Bjam- racking my brain

Daniele Carlucci

27 Jul 2004 27 Jul '04

8 p.m.

Hi, I'm a newby. Anyone can explain me the difference between: typedef adjacency_list

Show replies by date

Doug Gregor

27 Jul 27 Jul

8:20 p.m.

On Tuesday 27 July 2004 3:00 pm, Daniele Carlucci wrote:

...

Hi, I'm a newby. Anyone can explain me the difference between: typedef adjacency_list

In the first one, the edges outgoing from a vertex are stored in an std::list; in the second one, the edges outgoing from a vertex are stored in an std::vector. There's actually a good description of how to choose the right data structures here: http://www.boost.org/libs/graph/doc/using_adjacency_list.html#sec:choosing-g... Doug

Daniele Carlucci

9:01 p.m.

...

...
typedef adjacency_list
In the first one, the edges outgoing from a vertex are stored in an std::list; in the second one, the edges outgoing from a vertex are stored in an std::vector. There's actually a good description of how to choose the right data structures here:

http://www.boost.org/libs/graph/doc/using_adjacency_list.html#sec:choosing-g...

Doug

Yes but you have descript me only the first element the second vecS what does it mean? Thanks Daniele

Doug Gregor

9:04 p.m.

On Tuesday 27 July 2004 4:01 pm, Daniele Carlucci wrote:

...

...
...
typedef adjacency_list
In the first one, the edges outgoing from a vertex are stored in an std::list; in the second one, the edges outgoing from a vertex are stored in an std::vector. There's actually a good description of how to choose the right data structures here:

http://www.boost.org/libs/graph/doc/using_adjacency_list.html#sec:choosing -graph-type

Doug

Yes but you have descript me only the first element the second vecS what does it mean?

Same idea, but for the list (or vector) of vertices. It's all described in that link. Doug

Thomas Costa

8:50 p.m.

The first one will use an instantiation of std::list as the storage container for the out edge list of the graph and the second will use std::vector. Hence the performance characteristics (in time and memory) of various operations involving edges, like addition of edges, removal of edges, etc. will vary between the two. Look at http://boost.org/libs/graph/doc/using_adjacency_list.html#sec:choosing- graph-type for more discussion of this. On Jul 27, 2004, at 1:00 PM, Daniele Carlucci wrote:

...

Hi, I'm a newby. Anyone can explain me the difference between: typedef adjacency_list
Thanks Daniele _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

7515

Age (days ago)

7515

Last active (days ago)

List overview

Download

4 comments

3 participants

participants (3)

Daniele Carlucci
Doug Gregor
Thomas Costa