Hi,
You're mixing the older interior graph properties with the syntax for accessing bundled properties. If you use bundled properties, you can access them with the [] operators, but you can't access the old-style interior graph properties that way. You can read more about bundled properties here:
http://www.boost.org/libs/graph/doc/bundles.html
and the older interior properties are documented here:
http://www.boost.org/libs/graph/doc/using_adjacency_list.html#sec:adjacency-
<snip> list-properties
Regards, Aaron
ok thx. The problem arose not because I used directly the operator[], but because I explicitly instantiated all members. It would at least help me if a simple wrapper was build around the boost graph. We don't use all advanced features, just a fairly simple unweighted directed graph (average 2-10 vertices) and only want to detect connectivity and cycles. The vertices should have stable vertex descriptors (if one makes a copy of the graph). wkr, me