%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% $Id $
% File:		lib/COMBINAT/DOC/freeTreesLabelled.tex
% Authors:	Nicolas M. Thiéry <nthiery@users.sourceforge.net>
% Purpose:	Documentation for the domain combinat::freeTreesLabelled
% Created:	Mon Jan 12 15:54:36 2004
% License:	LGPL
% Project:	MuPAD-Combinat, http://mupad-combinat.sf.net
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\begin{Mhelppage}{freeTreesLabelled}{Nicolas M. Thiéry}
  [ImplState=beta,TestState=stable,DocState=beta]
%\Mproofread{...}{...}{...}

\begin{MInfo}
  \eng{labelled free trees}
  \de{}
\end{MInfo}

\begin{MIntro}
  \eng{\Mthis{} represents the combinatorial class of labelled free
    trees (i.e. connected acyclic graphs on $n$ distinct nodes).}
  \eng{Such trees are currently represented by lists of edges; this is
    likely to change!}
\end{MIntro}


\begin{MMethodDetails}{fromListPrufer}
  \infoEng{Prüfer bijective correspondence}
  \call{\Mtype{list of positive integer} l}
  \eng{Returns the free tree on $n$ nodes associated via the Prüfer
    correspondence to the list \Mpar{l} of $n-2$ integers between $0$
    and $n$.}
\end{MMethodDetails}

\begin{MMethodDetails}{toListPrufer}
  \infoEng{Prüfer bijective correspondence}
  \call{\Mtype{dom} t}
  \eng{Returns the list \Mex{l} of $n-2$ integers between $0$ and $n$
    associated to the free tree \Mpar{t} on $n$ nodes via the Prüfer
    correspondence.}
\end{MMethodDetails}

\begin{MChanges}
  \version{3.1}
  \eng[New domain]{\Mthis{} is a new domain} %
\end{MChanges}

\end{Mhelppage}
