I have already post this email, but I cannot see it on the list. So, I post it again ... Sorry ... Hi all, I am a new boost user (2 days old ...). I just want to know a few things. 1. I use an adjacency_list with my own properties to store my graph. I just want to know if it is possible to manipulate directly the properties' values. At the moment, I use get(...) to obtain the property, make my change, and use put(...) to set the new value. 2. My graph cannot contain parallel edges, so I use a setS. However, the documentation says that listS or vecS is more efficient in time and space complexity. Is it possible to use std::vector or std::list and to disallow parallele edges ? Thanks in advance Olivier --------------------------------- Découvrez un nouveau moyen de poser toutes vos questions quelque soit le sujet ! Yahoo! Questions/Réponses pour partager vos connaissances, vos opinions et vos expériences. Cliquez ici.
Try your post with [graph] at the start of the title. That way those who are interested in the graph library are more likely to look at your post.
Hi Olivier, 2006/9/11, Olivier Tournaire <olitour@yahoo.fr>:
1. I use an adjacency_list with my own properties to store my graph. I just want to know if it is possible to manipulate directly the properties' values. At the moment, I use get(...) to obtain the property, make my change, and use put(...) to set the new value.
Maybe you should have a look at the bundled properties docs: http://www.boost.org/libs/graph/doc/bundles.html If you use them, you have access to the edge/vertex bundle through operator[] on the graph.
2. My graph cannot contain parallel edges, so I use a setS. However, the documentation says that listS or vecS is more efficient in time and space complexity. Is it possible to use std::vector or std::list and to disallow parallele edges ?
Yes. Check this thread from a few days ago: http://thread.gmane.org/gmane.comp.lib.boost.user/21514/ HTH, Stephan
participants (3)
-
Jason House -
Olivier Tournaire -
Stephan Diederich