[Lemon-devel] Finalization naming

[Alpár Jüttner]

> So the node query functions will be red() and blue()?
> For an edge of a Bigraph there will be 3 different way to query the end nodes:
> red()/blue() as bipartite (undirected) graph, anode()/bnode() as undirected
> graph, and source()/target() as a directed graph with the default direction
> (not including the baseNode()/runningNode() query)?

You are right. This is because this graph is
      * directed
      * undirected
      * bipartite
Keep in mind, that these functions are not implemented by hand, but they
are basically generated. Thus it makes it no more difficult e.g. to
implement a new graph type.

Alpar