Mercurial > octave
view scripts/sparse/treeplot.m @ 28789:28de41192f3c
Eliminate unneeded verification of nargin, nargout in m-files.
* FIRfilter.m, FIRfilter_aggregation.m, get.m, polynomial.m,
polynomial_superiorto.m, polynomial2.m, makeUniqueStrings.m, base64decode.m,
base64encode.m, cd.m, lin2mu.m, record.m, sound.m, soundsc.m, accumarray.m,
accumdim.m, bitcmp.m, bitset.m, cart2pol.m, celldisp.m, circshift.m,
cplxpair.m, cumtrapz.m, flip.m, idivide.m, interpft.m, logspace.m, pol2cart.m,
polyarea.m, postpad.m, prepad.m, rat.m, rot90.m, rotdim.m, shift.m, shiftdim.m,
sortrows.m, trapz.m, dsearch.m, dsearchn.m, getappdata.m, getpixelposition.m,
guidata.m, guihandles.m, isappdata.m, listfonts.m, uigetdir.m,
waitforbuttonpress.m, __makeinfo__.m, doc.m, get_first_help_sentence.m,
autumn.m, bone.m, brighten.m, cmpermute.m, cmunique.m, colorcube.m, contrast.m,
cool.m, copper.m, cubehelix.m, flag.m, gray.m, gray2ind.m, hot.m, hsv.m,
im2double.m, im2frame.m, imformats.m, jet.m, lines.m, ocean.m, pink.m, prism.m,
rainbow.m, rgbplot.m, spinmap.m, spring.m, summer.m, viridis.m, white.m,
winter.m, beep.m, importdata.m, is_valid_file_id.m, javachk.m, javaclasspath.m,
findstr.m, genvarname.m, strmatch.m, bandwidth.m, commutation_matrix.m, cond.m,
cross.m, isdefinite.m, ishermitian.m, issymmetric.m, krylov.m, linsolve.m,
logm.m, lscov.m, null.m, ordeig.m, orth.m, rank.m, rref.m, vecnorm.m,
bunzip2.m, citation.m, computer.m, copyfile.m, dir.m, dos.m, fileattrib.m,
gunzip.m, inputParser.m, inputname.m, ismac.m, ispc.m, isunix.m, license.m,
list_primes.m, methods.m, mkdir.m, movefile.m, nargchk.m, news.m,
orderfields.m, recycle.m, tar.m, unix.m, unpack.m, untar.m, unzip.m, ver.m,
version.m, what.m, zip.m, decic.m, fminbnd.m, fminunc.m, fsolve.m, fzero.m,
glpk.m, humps.m, lsqnonneg.m, optimget.m, pqpnonneg.m, sqp.m, pathdef.m,
camlookat.m, hidden.m, specular.m, plotmatrix.m, smooth3.m, sombrero.m,
stemleaf.m, __gnuplot_drawnow__.m, __opengl_info__.m, ancestor.m, cla.m,
close.m, closereq.m, copyobj.m, gca.m, gcf.m, ginput.m, graphics_toolkit.m,
groot.m, hgload.m, hgsave.m, isgraphics.m, ishold.m, linkaxes.m, meshgrid.m,
newplot.m, refresh.m, refreshdata.m, rotate.m, saveas.m, struct2hdl.m, conv.m,
mkpp.m, mpoles.m, padecoef.m, pchip.m, polyder.m, polyfit.m, polygcd.m,
polyint.m, polyout.m, polyval.m, ppder.m, ppint.m, getpref.m, ispref.m,
rmpref.m, profexport.m, profshow.m, powerset.m, arch_fit.m, arma_rnd.m,
blackman.m, detrend.m, diffpara.m, fftconv.m, fftfilt.m, filter2.m, freqz.m,
freqz_plot.m, hamming.m, hanning.m, sinetone.m, sinewave.m, spectral_adf.m,
spectral_xdf.m, stft.m, unwrap.m, gplot.m, ichol.m, ilu.m, spdiags.m, sprand.m,
sprandn.m, spstats.m, svds.m, treelayout.m, treeplot.m, betainc.m,
betaincinv.m, ellipke.m, gammainc.m, gammaincinv.m, legendre.m, pow2.m,
hankel.m, pascal.m, rosser.m, toeplitz.m, bounds.m, corr.m, cov.m, histc.m,
kendall.m, kurtosis.m, mad.m, mode.m, moment.m, prctile.m, quantile.m, range.m,
ranks.m, run_count.m, skewness.m, spearman.m, std.m, var.m, zscore.m,
dec2base.m, dec2bin.m, dec2hex.m, index.m, mat2str.m, native2unicode.m,
ostrsplit.m, strjoin.m, strjust.m, strtok.m, substr.m, unicode2native.m,
untabify.m, __debug_octave__.m, demo.m, example.m, fail.m, oruntests.m,
dump_demos.m, speed.m, test.m, date.m, datenum.m, datestr.m, datevec.m,
is_leap_year.m, now.m, weekday.m:
Eliminate unneeded verification of nargin, nargout in m-files now that
the interpreter checks these values.
author | Rik <rik@octave.org> |
---|---|
date | Thu, 24 Sep 2020 14:44:58 -0700 |
parents | bd51beb6205e |
children | 7854d5752dd2 |
line wrap: on
line source
######################################################################## ## ## Copyright (C) 2005-2020 The Octave Project Developers ## ## See the file COPYRIGHT.md in the top-level directory of this ## distribution or <https://octave.org/copyright/>. ## ## This file is part of Octave. ## ## Octave is free software: you can redistribute it and/or modify it ## under the terms of the GNU General Public License as published by ## the Free Software Foundation, either version 3 of the License, or ## (at your option) any later version. ## ## Octave is distributed in the hope that it will be useful, but ## WITHOUT ANY WARRANTY; without even the implied warranty of ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the ## GNU General Public License for more details. ## ## You should have received a copy of the GNU General Public License ## along with Octave; see the file COPYING. If not, see ## <https://www.gnu.org/licenses/>. ## ######################################################################## ## -*- texinfo -*- ## @deftypefn {} {} treeplot (@var{tree}) ## @deftypefnx {} {} treeplot (@var{tree}, @var{node_style}, @var{edge_style}) ## Produce a graph of tree or forest. ## ## The first argument is vector of predecessors. ## ## The optional parameters @var{node_style} and @var{edge_style} define the ## output plot style. ## ## The complexity of the algorithm is O(n) in terms of is time and memory ## requirements. ## @seealso{etreeplot, gplot} ## @end deftypefn function treeplot (tree, node_style = "ko", edge_style = "r") if (nargin < 1) print_usage (); endif if (! isnumeric (tree) || ! isrow (tree) || any (tree > length (tree))) error ("treeplot: TREE must be a vector of predecessors"); endif ## Verify node_style if (nargin > 1) if (isempty (regexp (node_style, '[ox+*]', 'once'))) node_style = [node_style, "o"]; endif endif ## Make it a row vector. tree = tree(:)'; ## The count of nodes of the graph. num_nodes = length (tree); ## The number of children. num_children = zeros (1, num_nodes+1); for i = 1:num_nodes ## VEC_OF_CHILD is helping vector which is used to speed up the ## choose of descendant nodes. num_children(tree(i)+1) = num_children(tree(i)+1) + 1; endfor pos = 1; start = zeros (1, num_nodes+1); xhelp = zeros (1, num_nodes+1); stop = zeros (1, num_nodes+1); for i = 1:num_nodes+1 start(i) = pos; xhelp(i) = pos; pos += num_children(i); stop(i) = pos; endfor for i = 1:num_nodes vec_of_child(xhelp(tree(i)+1)) = i; xhelp(tree(i)+1) = xhelp(tree(i)+1)+1; endfor ## The number of "parent" (actual) node (its descendants will be ## browse in the next iteration). par_number = 0; ## The x-coordinate of the left most descendant of "parent node" ## this value is increased in each leaf. left_most = 0; ## The level of "parent" node (root level is num_nodes). level = num_nodes; ## Num_nodes - max_ht is the height of this graph. max_ht = num_nodes; ## Main stack - each item consists of two numbers - the number of ## node and the number it's of parent node on the top of stack ## there is "parent node". stk = [-1, 0]; ## Stack which is used to draw the graph edge (it has to be an ## uninterrupted line). skelet = 0; ## The top of the stack. while (par_number != -1) if (start(par_number+1) < stop(par_number+1)) idx = vec_of_child(start(par_number+1):stop(par_number+1)-1); else idx = zeros (1, 0); endif ## Add to idx the vector of parent descendants. stk = [stk; [idx', ones(fliplr(size(idx)))*par_number]]; ## Add to stack the records relevant to parent descendant s. if (par_number != 0) skelet = [skelet; ([ones(size(idx))*par_number; idx])(:)]; endif ## If there is not any descendant of "parent node": if (stk(end,2) != par_number) left_most += 1; x_coordinate_r(par_number) = left_most; max_ht = min (max_ht, level); if (length (stk) > 1 && find ((shift (stk,1) - stk) == 0) > 1 && stk(end,2) != stk(end-1,2)) ## Return to the nearest branching the position to return ## position is the position on the stack, where should be ## started further search (there are two nodes which has the ## same parent node). position = (find ((shift (stk(:,2),1) - stk(:,2)) == 0))(end) + 1; par_number_vec = stk(position:end,2); ## The vector of removed nodes (the content of stack form ## position to end). skelet = [skelet; flipud(par_number_vec)]; level += length (par_number_vec); ## The level have to be decreased. x_coordinate_r(par_number_vec) = left_most; stk(position:end,:) = []; endif ## Remove the next node from "searched branch". stk(end,:) = []; ## Choose new "parent node". par_number = stk(end,1); ## If there is another branch start to search it. if (par_number != -1) skelet = [skelet; stk(end,2); par_number]; y_coordinate(par_number) = level; x_coordinate_l(par_number) = left_most + 1; endif else ## There were descendants of "parent nod" choose the last of ## them and go on through it. level -= 1; par_number = stk(end,1); y_coordinate(par_number) = level; x_coordinate_l(par_number) = left_most + 1; endif endwhile ## Calculate the x coordinates (the known values are the position ## of most left and most right descendants). x_coordinate = (x_coordinate_l + x_coordinate_r) / 2; ## FIXME: We should probably stuff all the arguments into a cell ## array and make a single call to plot here so we can avoid ## setting the hold state... hold_is_on = ishold (); unwind_protect ## Plot graph nodes. plot (x_coordinate, y_coordinate, node_style); ## Helping command - usable for plotting edges skelet = [skelet; 0]; ## Draw graph edges. idx = find (skelet == 0); hold ("on"); ## Plot each tree component in one loop. for i = 2:length (idx) ## Tree component start. istart = idx(i-1) + 1; ## Tree component end. istop = idx(i) - 1; if (istop - istart < 1) continue; endif plot (x_coordinate(skelet(istart:istop)), y_coordinate(skelet(istart:istop)), edge_style); endfor ## Set axis and graph size. axis ([0.5, left_most+0.5, max_ht-0.5, num_nodes-0.5], "nolabel"); unwind_protect_cleanup if (! hold_is_on) hold ("off"); endif end_unwind_protect endfunction %!demo %! clf; %! treeplot ([2 4 2 0 6 4 6]); %! % Plot a simple tree plot %!demo %! clf; %! treeplot ([2 4 2 0 6 4 6], "b+", "g"); %! % Plot a simple tree plot defining the edge and node styles