Syntax
[ELlf,ELtr,SIL,knod,leaf]=ELgraphleafs(EL,[rekurs])
Input Parameter
EL : | | Edge List |
rekurs : | | if true; the remaining tree contains just closed loops |
Output Parameter
ELlf : | | AL Branches of the leaves sorted outwards |
ELtr : | | remaining tree of the tree unchanged sorted by loops if rekursively |
SIL : | | Select index list; undependent |
knod : | | list of node |
leaf : | | list of leafs (ELlf(:,2)) |
Examples
ELgraphleafs(ELofn(10),true)
Copyright 2023-2025 Tim C. Lueth. All rights reserved. The code is the property of Tim C. Lueth and may not be redistributed or modified without explicit written permission. This software may be used free of charge for academic research and teaching purposes only. Commercial use, redistribution, modification, or reverse engineering is strictly prohibited. Access to source code is restricted and granted only under specific agreements. For licensing inquiries or commercial use, please contact: Tim C. Lueth
Last html export of this page out of FM database by TL: 2025-09-21