Subject: Re: [Seqan-dev] getting vertex descriptors from graphs
Hi David!
Okay thanks - then i'll stick to the STL!
best,
Mat
Am 1/13/11 3:50 PM, schrieb Weese, David:
Hi Mat,
Property maps are one-way maps from SeqAn's point of view. If
you need an efficient reverse map, you have to use a STL map
that maps strings to IDs (=VertexDescriptor).
Anybody could give me a hint on the following problem?
I created a directed graph and added some nodes. Each
node has an additional datastructure (VertexProperty -
node name and size...) which is linked to each node by a
vertexMap.
Now: Later on i would like to add some edges to my
graph, so i need two VertexDescriptor's to add an edge.
Is there a standard way to search a vertexMap's via
VertexProperties and get the corresponding
VertexDescriptor?
One way would be to iterate on the vertexMap and look
for a VertexProperty but this might be to slow...
Thanks!
>>>
//EdgeProperty and VertexProperty store additional
information...
typedef Graph<Directed<EdgeProperty> >
GraphType;
GraphType *contigGraph = new GraphType();