Re: [Boost-users] [graph] Graph type needed in graph proptery, cyclic definition problem, minimal example

Subject: Re: [Boost-users] [graph] Graph type needed in graph proptery, cyclic definition problem, minimal example
From: Christoph (c_p_at_[hidden])
Date: 2011-10-26 15:36:46

Hi,

> See 
>
http://stackoverflow.com/questions/4232409/how-to-solve-boostbgl-template-class-circular-dependency 

[...]

funny this is my own mail and your answer. Thank you again for that one.

> or http://comments.gmane.org/gmane.comp.lib.boost.user/70832 for the 
> solution to that problem.
> 
> -- Jeremiah Willcock
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users
> 

[...]

i am sorry but i can't find the solution to my problem. I know how to
use
 
boost::adjacency_list_traits<boost::listS, boost::vecS,
boost::bidirectionalS>::vertex_descriptor

and

boost::adjacency_list_traits<boost::listS, boost::vecS,
boost::bidirectionalS>::edge_descriptor

inside of bundled graph properties but i need the graph type itself to
use 'vertex_degree (u, g)' in the comparison object given to a
priority_queue inside of the graph_property struct (see first example).

best regards
Christoph