i:SSKrSSKrSSKrSSKrSSKJrJr SSKJr SSK J r SSK J r \R"S5r"SS5r"S S \5rg) N)pathremove) check_call)NamedTemporaryFile) PreOrderIterz["\\]c\rSrSrSrSSjrSr\S5r\S5r \S5r \S 5r \S 5r S r S rS rSrSrSr\S5rSrg) DotExportera Dot Language Exporter. Args: node (Node): start node. Keyword Args: graph: DOT graph type. name: DOT graph name. options: list of options added to the graph. indent (int): number of spaces for indent. nodenamefunc: Function to extract node name from `node` object. The function shall accept one `node` object as argument and return the name of it. nodeattrfunc: Function to decorate a node with attributes. The function shall accept one `node` object as argument and return the attributes. edgeattrfunc: Function to decorate a edge with attributes. The function shall accept two `node` objects as argument. The first the node and the second the child and return the attributes. edgetypefunc: Function to which gives the edge type. The function shall accept two `node` objects as argument. The first the node and the second the child and return the edge (i.e. '->'). filter_: Function to filter nodes to include in export. The function shall accept one `node` object as argument and return True if it should be included, or False if it should not be included. stop: stop iteration at `node` if `stop` function returns `True` for `node`. maxlevel (int): Limit export to this number of levels. >>> from anytree import Node >>> root = Node("root") >>> s0 = Node("sub0", parent=root, edge=2) >>> s0b = Node("sub0B", parent=s0, foo=4, edge=109) >>> s0a = Node("sub0A", parent=s0, edge="") >>> s1 = Node("sub1", parent=root, edge="") >>> s1a = Node("sub1A", parent=s1, edge=7) >>> s1b = Node("sub1B", parent=s1, edge=8) >>> s1c = Node("sub1C", parent=s1, edge=22) >>> s1ca = Node("sub1Ca", parent=s1c, edge=42) .. note:: If the node names are not unique, see :any:`UniqueDotExporter`. A directed graph: >>> from anytree.exporter import DotExporter >>> for line in DotExporter(root): ... print(line) digraph tree { "root"; "sub0"; "sub0B"; "sub0A"; "sub1"; "sub1A"; "sub1B"; "sub1C"; "sub1Ca"; "root" -> "sub0"; "root" -> "sub1"; "sub0" -> "sub0B"; "sub0" -> "sub0A"; "sub1" -> "sub1A"; "sub1" -> "sub1B"; "sub1" -> "sub1C"; "sub1C" -> "sub1Ca"; } The resulting graph: .. image:: ../static/dotexporter0.png An undirected graph: >>> def nodenamefunc(node): ... return '%s:%s' % (node.name, node.depth) >>> def edgeattrfunc(node, child): ... return 'label="%s:%s"' % (node.name, child.name) >>> def edgetypefunc(node, child): ... return '--' >>> from anytree.exporter import DotExporter >>> for line in DotExporter(root, graph="graph", ... nodenamefunc=nodenamefunc, ... nodeattrfunc=lambda node: "shape=box", ... edgeattrfunc=edgeattrfunc, ... edgetypefunc=edgetypefunc): ... print(line) graph tree { "root:0" [shape=box]; "sub0:1" [shape=box]; "sub0B:2" [shape=box]; "sub0A:2" [shape=box]; "sub1:1" [shape=box]; "sub1A:2" [shape=box]; "sub1B:2" [shape=box]; "sub1C:2" [shape=box]; "sub1Ca:3" [shape=box]; "root:0" -- "sub0:1" [label="root:sub0"]; "root:0" -- "sub1:1" [label="root:sub1"]; "sub0:1" -- "sub0B:2" [label="sub0:sub0B"]; "sub0:1" -- "sub0A:2" [label="sub0:sub0A"]; "sub1:1" -- "sub1A:2" [label="sub1:sub1A"]; "sub1:1" -- "sub1B:2" [label="sub1:sub1B"]; "sub1:1" -- "sub1C:2" [label="sub1:sub1C"]; "sub1C:2" -- "sub1Ca:3" [label="sub1C:sub1Ca"]; } The resulting graph: .. image:: ../static/dotexporter1.png To export custom node implementations or :any:`AnyNode`, please provide a proper `nodenamefunc`: >>> from anytree import AnyNode >>> root = AnyNode(id="root") >>> s0 = AnyNode(id="sub0", parent=root) >>> s0b = AnyNode(id="s0b", parent=s0) >>> s0a = AnyNode(id="s0a", parent=s0) >>> from anytree.exporter import DotExporter >>> for line in DotExporter(root, nodenamefunc=lambda n: n.id): ... print(line) digraph tree { "root"; "sub0"; "s0b"; "s0a"; "root" -> "sub0"; "sub0" -> "s0b"; "sub0" -> "s0a"; } Nc XlX lX0lX@lXPlX`lXplXlXlXl Xl Xl gN) nodegraphnameoptionsindent nodenamefunc nodeattrfunc edgeattrfunc edgetypefuncfilter_maxlevelstop) selfr rrrrrrrrrrrs I/app/mltbenv/lib/python3.13/site-packages/anytree/exporter/dotexporter.py__init__DotExporter.__init__sD     ((((   c|SUR-nUR=(d URnUR=(d URnUR =(d UR nUR=(d URnUR=(d URnURXX4XV5$)N ) rr_default_nodenamefuncr_default_nodeattrfuncr_default_edgeattrfuncr_default_edgetypefuncr_default_filter_DotExporter__iterrrrrrrrs r__iter__DotExporter.__iter__st{{"((FD,F,F ((FD,F,F ((FD,F,F ((FD,F,F ,,6$"6"6{{6\ccrcUR$r rr s rr !DotExporter._default_nodenamefuncs yyrcgr r+s rr!!DotExporter._default_nodeattrfuncrcgr r.r childs rr"!DotExporter._default_edgeattrfuncr0rcg)Nz->r.r2s rr#!DotExporter._default_edgetypefuncr0rcg)NTr.r+s rr$DotExporter._default_filterr0rc## URSURS3v URU5ShvN URXX65ShvN UR XXEU5ShvN Sv gN>N&N 7f)Nrz {})rr_DotExporter__iter_options_DotExporter__iter_nodes_DotExporter__iter_edgesr&s r__iterDotExporter.__iterss Adii[,,&&v...$$V<QQQ$$VnU"U5nU"U5nUbSUS3OSnUS[R U5SUS3v M@ g7f)Nrrr []";)rr rrr esc)rrrrrr nodenamenodeattrs r __iter_nodesDotExporter.__iter_nodesst G))VZVcVcdD#D)H#D)H+3+?H:Q'RHHAkooh78(1E E esA-A/c ## UR(aURS- OSn[URXPRUS9HnU"U5nURHnn U"U 5(dMU"U 5n U"Xy5n U"Xy5n U bSU S3OSn US[ R U5SU S[ R U 5SU S 3 v Mp M g7f) NrErFrGrHrIz" z "rJ)rrr rchildrenr rK) rrrrrrrr rLr3 childnameedgeattredgetypes r __iter_edgesDotExporter.__iter_edgess(, 4==1$4 G))V^_D#D)Hu~~(/ '4'4/7/CRz++//(";!>> from anytree import Node >>> root = Node("root") >>> s0 = Node("sub0", parent=root) >>> s0b = Node("sub0B", parent=s0) >>> s0a = Node("sub0A", parent=s0) >>> s1 = Node("sub1", parent=root) >>> s1a = Node("sub1A", parent=s1) >>> s1b = Node("sub1B", parent=s1) >>> s1c = Node("sub1C", parent=s1) >>> s1ca = Node("sub1Ca", parent=s1c) >>> from anytree.exporter import DotExporter >>> DotExporter(root).to_dotfile("tree.dot") The generated file should be handed over to the `dot` tool from the http://www.graphviz.org/ package:: $ dot tree.dot -T png -o tree.png wzutf-8 N)codecsopenwrite)rfilenamefilelines r to_dotfileDotExporter.to_dotfiles>.[[3 0D dV2;'1 0 0s A Ac[R"U5SSSn[SSS9nURnUH%nUR US3R 55 M' UR 5 SUSUS U/n[U5 SSS5 [W5 g!,(df  N=f![a- [R"[5RS W5 gf=f) z Write graph to a temporary file and invoke `dot`. The output file type is automatically detected from the file suffix. *`graphviz` needs to be installed, before usage of this method.* rQNwbF)deleterZdotz-Tz-oz"Could not remove temporary file %s)rsplitextrrr]encodeflushrr Exceptionlogging getLogger__name__warning)rr^ fileformatdotfile dotfilenamer`cmds r to_pictureDotExporter.to_pictures]]8,Q/3 U 3w!,,K $r{2245 MMO+tZxHC sO 4 c ; 4 3 c   h ' / /0TVa b csAB B( B%(4CCcB[RS[U55$)zEscape Strings.c*SURS53$)N\r)group)ms r!DotExporter.esc..3s!''!*%6r)_RE_ESCsubstr)values rrKDotExporter.esc0s{{6E CCr) rrrrrrrr rrrr digraphtreeNNNNNNNN)rm __module__ __qualname____firstlineno____doc__rr' staticmethodr r!r"r#r$r%r;r<r=rarsrK__static_attributes__r.rrr r sOh  8d* F t(6c,DDrr c\^\rSrSrSrSU4SjjrSr\S5rSr U=r $)UniqueDotExporteri6a Unique Dot Language Exporter. Handle trees with random or conflicting node names gracefully. Args: node (Node): start node. Keyword Args: graph: DOT graph type. name: DOT graph name. options: list of options added to the graph. indent (int): number of spaces for indent. nodenamefunc: Function to extract node name from `node` object. The function shall accept one `node` object as argument and return the name of it. nodeattrfunc: Function to decorate a node with attributes. The function shall accept one `node` object as argument and return the attributes. edgeattrfunc: Function to decorate a edge with attributes. The function shall accept two `node` objects as argument. The first the node and the second the child and return the attributes. edgetypefunc: Function to which gives the edge type. The function shall accept two `node` objects as argument. The first the node and the second the child and return the edge (i.e. '->'). filter_: Function to filter nodes to include in export. The function shall accept one `node` object as argument and return True if it should be included, or False if it should not be included. stop: stop iteration at `node` if `stop` function returns `True` for `node`. maxlevel (int): Limit export to this number of levels. >>> from anytree import Node >>> root = Node("root") >>> s0 = Node("sub0", parent=root) >>> s0b = Node("s0", parent=s0) >>> s0a = Node("s0", parent=s0) >>> s1 = Node("sub1", parent=root) >>> s1a = Node("s1", parent=s1) >>> s1b = Node("s1", parent=s1) >>> s1c = Node("s1", parent=s1) >>> s1ca = Node("sub1Ca", parent=s1c) >>> from anytree.exporter import UniqueDotExporter >>> for line in UniqueDotExporter(root): ... print(line) digraph tree { "0x0" [label="root"]; "0x1" [label="sub0"]; "0x2" [label="s0"]; "0x3" [label="s0"]; "0x4" [label="sub1"]; "0x5" [label="s1"]; "0x6" [label="s1"]; "0x7" [label="s1"]; "0x8" [label="sub1Ca"]; "0x0" -> "0x1"; "0x0" -> "0x4"; "0x1" -> "0x2"; "0x1" -> "0x3"; "0x4" -> "0x5"; "0x4" -> "0x6"; "0x4" -> "0x7"; "0x7" -> "0x8"; } The resulting graph: .. image:: ../static/uniquedotexporter2.png To export custom node implementations or :any:`AnyNode`, please provide a proper `nodeattrfunc`: >>> from anytree import AnyNode >>> root = AnyNode(id="root") >>> s0 = AnyNode(id="sub0", parent=root) >>> s0b = AnyNode(id="s0", parent=s0) >>> s0a = AnyNode(id="s0", parent=s0) >>> from anytree.exporter import UniqueDotExporter >>> for line in UniqueDotExporter(root, nodeattrfunc=lambda n: 'label="%s"' % (n.id)): ... print(line) digraph tree { "0x0" [label="root"]; "0x1" [label="sub0"]; "0x2" [label="s0"]; "0x3" [label="s0"]; "0x0" -> "0x1"; "0x1" -> "0x2"; "0x1" -> "0x3"; } c x>[T U]UUUUUUUUU U U U S9 0Ul[R"5Ulg)N) rrrrrrrrrrr)superr_UniqueDotExporter__node_ids itertoolscount _UniqueDotExporter__node_counter)rr rrrrrrrrrrr __class__s rrUniqueDotExporter.__init__sS  %%%%  'oo/rc[U5nURUn[ U5$![a& [UR5=o0RU'N:f=fr )idrKeyErrornextrhex)rr node_idnums rr 'UniqueDotExporter._default_nodenamefuncsYT( G//'*C3x G-1$2E2E-F FC//'* Gs'-AAc"SURS3$)Nzlabel="rIr*r+s rr!'UniqueDotExporter._default_nodeattrfuncs 1%%r)__node_counter __node_idsr) rmrrrrrr rr!r __classcell__)rs@rrr6sLfV  0B&&rr)r[rrkreosrr subprocessrtempfileranytreercompiler|r rr.rrrsH  !' **X eDeDP T& T&r