Mercurial > hg > octave-lyh

comparison scripts/sparse/treelayout.m @ 11469:c776f063fefe

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Overhaul m-script files to use common variable name between code and documentation.
author Rik <octave@nomad.inbox5.com>
date Sun, 09 Jan 2011 12:41:21 -0800
parents be55736a0783
children fd0a3ac60b0e
comparison
equal deleted inserted replaced
11468:e1edf0ba3bcb 11469:c776f063fefe
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 22 ## treelayout lays out a tree or a forest. The first argument @var{tree} is a
23 ## vector of 23 ## vector of
24 ## predecessors, optional parameter @var{permutation} is an optional postorder 24 ## predecessors, optional parameter @var{permutation} is an optional postorder
25 ## permutation. 25 ## permutation.
26 ## The complexity of the algorithm is O(n) in 26 ## The complexity of the algorithm is O(n) in
27 ## terms of time and memory requirements. 27 ## terms of time and memory requirements.