[Lemon-devel] Renaming basic classes

Balazs Dezso deba at inf.elte.hu
Tue Sep 18 16:57:51 CEST 2007


Hi

Digraph, Graph vs. Graph, Bigraph

>_ However the renaming of graph types isn't so clear for me. Is it really the
>_ best way to use 'digraph' for directed graphs? In this way our most general
>_ graph type would be ListDigraph (or ListDiGraph). Isn't it too complicated,
>_ especially for those who start using LEMON? And I think directed graphs are
>_ used more frequently, so it is important to use simple names for them.
>_
>_ Moreover I think Digraph-Graph renaming would cause much more problems than
>_ Arc-Edge renaming when we would like to convert source codes to the new
>_ version. For example if we forget to change Edge to Arc somewhere, we will
>_ get a compiler error, because the graph type doesn't have such typedef any
>_ more. However if we forget to change e.g. ListGraph to ListDigraph, the
>_ code will remain correct width Edge, EdgeIt, etc. but it does something
>_ very different, because it became undirected. Or this whole theory isn't
>_ correct?
>_ Peter Kovacs

> I miss the directed/undirected version of the bipartite graphs.

I think the directed bipartite graph is an irrelevant graph class. I do not 
know algorithm which run on this type of graph. The residual graph of a 
matching could be the only application, but in this case the algorithm does 
not need to build explicit the graph.

I forgot that we have more Peters on the mailing-list, so my suggestion to 
create wikipedia site was intended to Peter Hegyi.

Best, Balazs



More information about the Lemon-devel mailing list