[Lemon-user] Fwd: Reverse NodeMap?

[Balázs Dezső]

Hi,

you can also check:
 - IterableBoolMap, IterableIntMap and IterableValueMap
 - CrossRefMap

Balazs


On Fri, May 11, 2012 at 11:21 AM, Attila Bernáth <athos at cs.elte.hu> wrote:
> If I see well, the best thing you can do is to fill a
> std::map< std::string, Digraph::Node >
> (where Digraph is the digraph type you use).
>
> Attila
>
> 2012/5/11 BEVAN KOOPMAN <bevan.koopman at student.qut.edu.au>:
>> Hi,
>>
>> I have the following digraph and associated NodeMap:
>>
>> ListDigraph g;
>> ListDigraph::NodeMap<string> names(g);
>>
>> // nodes added, names assigned
>>
>> // graph serialised to graph.lgf
>>
>> Then in another program graph.lgf is read in.
>>
>> My question is: how can a I find the node associated with a given name, i.e. I need a name -> node mapping rather than NodeMap node -> name mapping?
>>
>> Thanks.
>>
>>
>> --
>> Bevan Koopman, PhD Candidate
>> Australian e-Health Research Centre, CSIRO
>> Queensland University of Technology (QUT)
>> [E]: bevan.koopman at csiro.au [T]: (61) 7 3253 3635
>> [W]: http://koopman.id.au   [L]: Brisbane, Australia
>> _______________________________________________
>> Lemon-user mailing list
>> Lemon-user at lemon.cs.elte.hu
>> http://lemon.cs.elte.hu/mailman/listinfo/lemon-user
>>
> _______________________________________________
> Lemon-user mailing list
> Lemon-user at lemon.cs.elte.hu
> http://lemon.cs.elte.hu/mailman/listinfo/lemon-user