Boost logo

Boost Users :

From: Greg Reynolds (gmr001_at_[hidden])
Date: 2006-11-18 07:47:15


Many thanks to all those who replied. I ended up using Marcel's solution.

This does seem rather cryptic though - perhaps the example needs to be
updated in the documentation?

Thanks again,

Greg

On Fri, 17 Nov 2006, Marcel Martin wrote:

> On Thursday 16 November 2006 16:06, Doug Gregor wrote:
>>> I include my code below. It compiles cleanly if I don't use
>>> subgraph, i.e.
>>> just declare the adjacency_list.
>>
>> The error I'm seeing is coming from the lack of an edge_index
>> property for the edges. If one adds that edge_index property,
>> subgraph should work.
>
> In case anyone else is wondering how to actually add the edge_index property,
> this is how I finally managed to get it to compile (using bundled and
> internal properties at the same time):
>
> typedef adjacency_list<vecS, vecS, undirectedS, VertexProperty,
> property<edge_index_t, int, EdgeProperty> > PlainGraph;
> typedef subgraph<PlainGraph> Graph;
>
> I tried to add a field named "edge_index" to the EdgeProperty struct at first,
> but that doesn't work.
>
> Marcel
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users
>


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