Thank you very much, I will try that. At the moment, I check manually the presence of parallel edges (not a long term solution). Matthieu Jeremiah Willcock a écrit :

On Tue, 18 Aug 2009, Andrew Sutton wrote:

...

I'd like to use the simple write_graphviz function write_graphviz(std::cout,g);

but since my graph doesn't allow multiple edges between two vertices, the graph type is defined by : typedef adjacency_list Graph;

but then I can't use the write_graphviz function anymore (compilation error). If I declare my graph with typedef adjacency_list Graph; it is fine, but have multiple edges...

So my question is : is there a way to use write_graphviz with the setS edges representation ?

I am not terribly familiar with the write_graphviz interface, so this may not be too helpful. I believe the problem is the manner in which setS and vecS identify vertices (descriptors) in the graph data structure. You may need to provide a vertex index map when you call write_graphviz, possibly using dynamic_properties. Unfortunately, I don't have any examples to point at. Perhaps other users will have encountered and solved the same problem.

I looked through the code, and that is the issue. You can either provide a vertex_index property map for your graph, or give an explicit vertex_id argument to write_graphviz.

-- Jeremiah Willcock ------------------------------------------------------------------------

_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users