The section pointed out says to use a set instead of list if you don't want parallel edges. I guess I was hoping to have parallel edge removal using a list (insertion/deletion consideration appear to make the list a better choice for me). A --- In Boost-Users@yahoogroups.com, "Arthur" <arthurc@t...> wrote:
Saw that... didn't help. Too many program fragments and not enough complete code examples IMHO. I guess I'll just have to figure it out the hard way.
A
--- In Boost-Users@yahoogroups.com, "Chris Russell" <cdr@e...> wrote:
Arthur,
see the following:
http://www.boost.org/libs/graph/doc/using_adjacency_list.html ^- see specifically "Choosing the EdgeList type".. Sequence vs. AssociativeContainer vs. UniqueAssociativeContainer
http://cvs.sourceforge.net/cgi- bin/viewcvs.cgi/boost/boost/libs/graph/example/container_gen.cpp? rev=1.1&content-type=text/vnd.viewcvs-markup ^- container_gen.cpp example
HTH - Chris
"Arthur" <arthurc@t...> wrote in message news:bbnl0i+k498@e...
I'm trying to use this graph class without detailed reading. I can't find a decent, clear example of doing this. I have a simple graph:
typedef adjacency_list<list, listS, bidirectionalS> Graph;
What do I do to prevent parallel edges to be inserted?
Thanks for any help offered, Arthur