[Lemon-user] Lemon ListDigraph::valid(Node) - Problem

[Todorov, Vladimir]

Hi there,

I am trying to make use of Lemon, but I encountered a problem with the "valid" method. I create two graphs. Initially they look the same. The problem is that when I take a node from one graph and check if it is valid it returns true for both graphs. In the documentation it is written:

bool valid

(

Node

n

)

const [inline]

This function gives back true if the given node is valid, i.e. it is a real node of the digraph.
Warning:
A removed node could become valid again if new nodes are added to the digraph.

The node that I am checking for is supposed to be valid node of only one of the graphs. Instead it seems to be valid in both of them and I cannot distinguish  to which one I  should consider it.  Is there a workaround and will this remain in the same way for future versions. I am using Lemon 1.2.2.


Regards,

Vladimir Todorov
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lemon.cs.elte.hu/pipermail/lemon-user/attachments/20110922/7a5e6d2f/attachment.html>