[Lemon-devel] Finalization naming

[Kovács Péter]

Hi,

I do support this version.

The only question for me is "Bigraph". It is very similar to Digraph, and I
still found it a bit misleading. I think there are only two basic graph type:
directed and undirected, not Graph, Digraph, Bigraph, which is suggested by
these names. Bipartite graphs are more special ones, so I would prefer more
special name for them (such as BiparGraph or something else).

> Red, Blue for bipartite graphs

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)?

Peter


On Tue, 9 Oct 2007 11:35:43 +0200, Balazs Dezso wrote
> Dear Developers,
> 
> I have concluded on a naming variation for lemon graphs after I long 
> skype call with Alpar.
> 
> The naming:
> Arc, Edge
> Digraph, Graph, Bigraph
> anode(), bnode() for undirected graphs
> Red, Blue for bipartite graphs
> 
> This is the final candidate version, therefore please comment it.
> 
> Best, Balazs