Mercurial > hg > octave-lyh

comparison scripts/sparse/treelayout.m @ 10793:be55736a0783

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Grammarcheck the documentation from m-files.
author Rik <octave@nomad.inbox5.com>
date Sun, 18 Jul 2010 20:35:16 -0700
parents 95c3e38098bf
children c776f063fefe
comparison
equal deleted inserted replaced
10792:91342260063e 10793:be55736a0783
15 ## You should have received a copy of the GNU General Public License 15 ## You should have received a copy of the GNU General Public License
16 ## along with Octave; see the file COPYING. If not, see 16 ## along with Octave; see the file COPYING. If not, see
17 ## <http://www.gnu.org/licenses/>. 17 ## <http://www.gnu.org/licenses/>.
18 18
19 ## -*- texinfo -*- 19 ## -*- texinfo -*-
20 ## @deftypefn {Function File} {} treelayout (@var{Tree}) 20 ## @deftypefn {Function File} {} treelayout (@var{Tree})
21 ## @deftypefnx {Function File} {} treelayout (@var{Tree}, @var{permutation}) 21 ## @deftypefnx {Function File} {} treelayout (@var{Tree}, @var{permutation})
22 ## treelayout lays out a tree or a forest. The first argument @var{Tree} is a vector of 22 ## treelayout lays out a tree or a forest. The first argument @var{Tree} is a
23 ## predecessors, optional parameter @var{permutation} is an optional postorder permutation. 23 ## vector of
24 ## predecessors, optional parameter @var{permutation} is an optional postorder
25 ## permutation.
24 ## The complexity of the algorithm is O(n) in 26 ## The complexity of the algorithm is O(n) in
25 ## terms of time and memory requirements. 27 ## terms of time and memory requirements.
26 ## @seealso{etreeplot, gplot,treeplot} 28 ## @seealso{etreeplot, gplot,treeplot}
27 ## @end deftypefn 29 ## @end deftypefn
28 30