[Lemon-devel] Renaming basic classes

[Kovács Péter]

Hi,

I try to summerize all the ideas suggested so far to make further discussions
and voting easier.

Graph structures
A1. Graph, UGraph   (current version, not supported by Alpar and Balazs)
A2. Graph, Ugraph   (not supported by Alpar and Balazs)
A3. DiGraph, Graph   
A4. Digraph, Graph

Biparitate graph structures
(if "Graph" is used for undirected graphs)
B1. BpGraph
B2. BiGraph   (not supported by Alpar)
B3. Bigraph   (not supported by Alpar)
B4. BiparGraph

Node query for directed and undirected edges
C1. source(), target()   source(), target()   (current version,
   not suppported by Balazs and Peter Kovacs)
C2. source(), target()   first(), second()
C3. source(), target()   either(), other()    (not supported by Alpar)
C4. source(), target()   aNode(), bNode()
C5. source(), target()   anode(), bnode()
C6. source(), target()   nodeA(), nodeB()
C7. source(), target()   nodea(), nodeb()
C8-C11. same as C4-C7. but with "ending" instead of "node"

Bigraph items and node query
D1. ANode, BNode, aNode(), bNode()  (current version)
D2. Anode, Bnode, anode(), bnode()
D3. NodeA, NodeB, nodeA(), nodeB()
D4. Nodea, Nodeb, nodea(), nodeb()
D5. First, Second, first(), second()
D6. Left, Right, left(), right()
D7. Lower, Upper, lower(), upper()
D8. Red, Blue, red(), blue()
D9. Boy, Girl, boy(), girl()        (not supported by Peter Kovacs)
D10. A, B, a(), b()                 (not supported by Peter Kovacs)

Directed and undirected edges:
- Edge, UEdge   (current verison, not supported at all)
- Arc, Edge     (seems to be supported by everyone)
So this is not a question any more.

According to the discussions made so far, now I support the following:
A4 (or A3), B4 (or B1), C2, D3 (or D6/D7/D8)

Best, Peter

PS. "anode" and "digraph" have a different meaning in other disciplines
("anode" is used in physics, "digraph" is used in linguistics), but I think
this wouldn't be annoying.