While looking for information about something else, I found a note under
"known problems" which states that subgraph can't work unless the vertex
descriptor is a vector (this is approximately true -- see the note for
more information).
For other cases, I've found workarounds that allow me to jam the index
into the algorithm (by passing the address of the member). So, for now
I'm not stuck, but I'd still be interested to know if there is a way to
make a graph with bundled properties that isn't a "second class
citizen."
-- Sal
P.S. my actual vertex type is listS; setS was a typo.
smile
--------------
Salvatore Domenick Desiano
Doctoral Candidate
Robotics Institute
Carnegie Mellon University
On Wed, 28 Nov 2007, Salvatore Domenick Desiano wrote:
o After several hours of reading the newsgroups and working backward through BGL
o header files, I've accepted that I need help.
o
o I have a graph with bundled properties. The edge properties include and index.
o I can't, for the life of me, figure out one thing:
o
o How do I get algorithms (e.g., those in subgraph) to see the edge
o index as a edge_index_t property?
o
o My code is fairly simple (though my failed attempts at getting subgraph, et
o al, to find the edge index have been long). Formatted for brevity:
o
o struct _Vertex_Data { unsigned index; unsigned blob_id; };
o struct _Edge_Data { unsigned index; unsigned count; };
o typedef adjacency_list