a º”h„}ã@sædZddlZddlZddlmZddlZddlmZgd¢Z Gdd„dƒZ Gdd „d e ƒZ Gd d „d e ƒZ Gd d „d e ƒZ Gdd„de ƒZGdd„deƒZGdd„deƒZd#dd„Zeddƒd$dd„ƒZdd„Zd%dd „Zd!d"„ZdS)&z- Text-based visual representations of graphs éN)Ú defaultdict)Ú open_file)Ú forest_strÚgenerate_network_textÚwrite_network_textc@seZdZedd„ƒZdS)Ú BaseGlyphscs‡fdd„tˆƒDƒS)Ncs*i|]"}| d¡s|dkr|tˆ|ƒ“qS)Ú_Úas_dict)Ú startswithÚgetattr)Ú.0Úa©Úcls©úE/var/www/auris/lib/python3.9/site-packages/networkx/readwrite/text.pyÚ sþz&BaseGlyphs.as_dict..)Údirrrrrr s þzBaseGlyphs.as_dictN)Ú__name__Ú __module__Ú __qualname__Ú classmethodr rrrrrsrc@sVeZdZUdZeed<dZeed<dZeed<dZeed<dZ eed <d Z eed <d S) ÚAsciiBaseGlyphsú+Úemptyz+-- Ú newtree_lastÚ newtree_midú Ú endof_forestz: Ú within_forestz| Ú within_treeN© rrrrÚstrÚ__annotations__rrrrr rrrrrs      rc@s>eZdZUdZeed<dZeed<dZeed<dZeed<d S) ÚAsciiDirectedGlyphszL-> Úlastz|-> Úmidz<-Úbackedgeú!Ú vertical_edgeN© rrrr%r"r#r&r'r)rrrrr$!s    r$c@s>eZdZUdZeed<dZeed<dZeed<dZeed<d S) ÚAsciiUndirectedGlyphszL-- r%z|-- r&ú-r'ú|r)Nr*rrrrr+(s    r+c@sVeZdZUdZeed<dZeed<dZeed<dZeed<d Z eed <d Z eed <d S)Ú UtfBaseGlyphsuâ•™ru ╙── ru ╟── rrruâ•Ž ru│ r Nr!rrrrr./s      r.c@s>eZdZUdZeed<dZeed<dZeed<dZeed<d S) ÚUtfDirectedGlyphsu └─╼ r%u ├─╼ r&u╾r'u╽r)Nr*rrrrr/;s    r/c@s>eZdZUdZeed<dZeed<dZeed<dZeed<d S) ÚUtfUndirectedGlyphsu └── r%u ├── r&u─r'u│r)Nr*rrrrr0Bs    r0TFc"#sFddlm‰m}G‡fdd„d|ƒ‰d}ˆ ¡}|rN|r>> graph = nx.path_graph(10) >>> graph.add_node('A') >>> graph.add_node('B') >>> graph.add_node('C') >>> graph.add_node('D') >>> graph.add_edge(9, 'A') >>> graph.add_edge(9, 'B') >>> graph.add_edge(9, 'C') >>> graph.add_edge('C', 'D') >>> graph.add_edge('C', 'E') >>> graph.add_edge('C', 'F') >>> nx.write_network_text(graph) ╙── 0 └── 1 └── 2 └── 3 └── 4 └── 5 └── 6 └── 7 └── 8 └── 9 ├── A ├── B └── C ├── D ├── E └── F >>> nx.write_network_text(graph, vertical_chains=True) ╙── 0 │ 1 │ 2 │ 3 │ 4 │ 5 │ 6 │ 7 │ 8 │ 9 ├── A ├── B └── C ├── D ├── E └── F r)ÚAnyÚ NamedTuplecs6eZdZU”ed<”ed<eed<eed<eed<dS)z)generate_network_text..StackFrameÚparentÚnodeÚindentsÚ this_islastÚ this_verticalN)rrrr#ÚlistÚboolr)r1rrÚ StackFrameØs r:ÚcollapseÚlabelNz ...écs$g|]\}}ˆd|g|ˆkdƒ‘qS)NFr)r Úidxr4)r:Úlast_idxrrÚ sÿz)generate_network_text..éÿÿÿÿcSsdS)NrrrrrrÚ óz'generate_network_text..TFÚcsg|]}|ˆvr|‘qSrr)r Úchild)Ú seen_nodesrrr@bscsg|]}|ˆvr|‘qSrr©r Úp)Úhandled_parentsrrr@yrCú, cs"g|]}tˆj| ˆ|¡ƒ‘qSr)r"ÚnodesÚgetrG)ÚgraphÚ label_attrrrr@}sÿcSsg|] }t|ƒ‘qSr)r"rGrrrr@„rCú )$Útypingr1r2Ú is_directedr$r/ÚsuccÚpredr+r0ZadjÚ isinstancer"rÚlenrKÚ _find_sourcesÚ enumeraterÚsetÚpopÚEllipsisÚappendÚaddrrrrr%r&r rLr8Újoinr'r))"rMÚ with_labelsÚsourcesÚ max_depthÚ ascii_onlyÚvertical_chainsr2Z collapse_attrrQÚglyphsrRrSÚstackZnum_skipped_childrenr3r4r5r6r7ÚskipZ next_islastZ try_frameZ this_prefixZ next_prefixr<ÚsuffixÚchildrenr;Z other_parentsZother_parents_labelsZ num_childrenZnext_is_verticalr>rEr)r1r:rMrIrNr?rFrrIsò      þý   ÿ  ÿ            ÿ   þÿ ÿ  ÿrr=ÚwÚ c Csh|durtjj}n,t|dƒr$|j}nt|ƒr2|}n tt|ƒƒ‚t||||||dD]} || |ƒqRdS)u¾Creates a nice text representation of a graph This works via a depth-first traversal of the graph and writing a line for each unique node encountered. Non-tree edges are written to the right of each node, and connection to a non-tree edge is indicated with an ellipsis. This representation works best when the input graph is a forest, but any graph can be represented. Parameters ---------- graph : nx.DiGraph | nx.Graph Graph to represent path : string or file or callable or None Filename or file handle for data output. if a function, then it will be called for each generated line. if None, this will default to "sys.stdout.write" with_labels : bool | str If True will use the "label" attribute of a node to display if it exists otherwise it will use the node value itself. If given as a string, then that attribute name will be used instead of "label". Defaults to True. sources : List Specifies which nodes to start traversal from. Note: nodes that are not reachable from one of these sources may not be shown. If unspecified, the minimal set of nodes needed to reach all others will be used. max_depth : int | None The maximum depth to traverse before stopping. Defaults to None. ascii_only : Boolean If True only ASCII characters are used to construct the visualization end : string The line ending character vertical_chains : Boolean If True, chains of nodes will be drawn vertically when possible. Examples -------- >>> graph = nx.balanced_tree(r=2, h=2, create_using=nx.DiGraph) >>> nx.write_network_text(graph) ╙── 0 ├─╼ 1 │ ├─╼ 3 │ └─╼ 4 └─╼ 2 ├─╼ 5 └─╼ 6 >>> # A near tree with one non-tree edge >>> graph.add_edge(5, 1) >>> nx.write_network_text(graph) ╙── 0 ├─╼ 1 ╾ 5 │ ├─╼ 3 │ └─╼ 4 └─╼ 2 ├─╼ 5 │ └─╼ ... └─╼ 6 >>> graph = nx.cycle_graph(5) >>> nx.write_network_text(graph) ╙── 0 ├── 1 │ └── 2 │ └── 3 │ └── 4 ─ 0 └── ... >>> graph = nx.cycle_graph(5, nx.DiGraph) >>> nx.write_network_text(graph, vertical_chains=True) ╙── 0 ╾ 4 ╽ 1 ╽ 2 ╽ 3 ╽ 4 └─╼ ... >>> nx.write_network_text(graph, vertical_chains=True, ascii_only=True) +-- 0 <- 4 ! 1 ! 2 ! 3 ! 4 L-> ... >>> graph = nx.generators.barbell_graph(4, 2) >>> nx.write_network_text(graph, vertical_chains=False) ╙── 4 ├── 5 │ └── 6 │ ├── 7 │ │ ├── 8 ─ 6 │ │ │ └── 9 ─ 6, 7 │ │ └── ... │ └── ... └── 3 ├── 0 │ ├── 1 ─ 3 │ │ └── 2 ─ 0, 3 │ └── ... └── ... >>> nx.write_network_text(graph, vertical_chains=True) ╙── 4 ├── 5 │ │ │ 6 │ ├── 7 │ │ ├── 8 ─ 6 │ │ │ │ │ │ │ 9 ─ 6, 7 │ │ └── ... │ └── ... └── 3 ├── 0 │ ├── 1 ─ 3 │ │ │ │ │ 2 ─ 0, 3 │ └── ... └── ... >>> graph = nx.complete_graph(5, create_using=nx.Graph) >>> nx.write_network_text(graph) ╙── 0 ├── 1 │ ├── 2 ─ 0 │ │ ├── 3 ─ 0, 1 │ │ │ └── 4 ─ 0, 1, 2 │ │ └── ... │ └── ... └── ... >>> graph = nx.complete_graph(3, create_using=nx.DiGraph) >>> nx.write_network_text(graph) ╙── 0 ╾ 1, 2 ├─╼ 1 ╾ 2 │ ├─╼ 2 ╾ 0 │ │ └─╼ ... │ └─╼ ... └─╼ ... NÚwrite)r^r_r`rarb)ÚsysÚstdoutrjÚhasattrÚcallableÚ TypeErrorÚtyper) rMÚpathr^r_r`raÚendrbÚ_writeÚlinerrrr¦s"&   ú rc s؈ ¡r¨tt ˆ¡ƒ}t ˆ|¡}dd„| ¡Dƒ}|jd}ˆjD]}||}|| |¡qDg}| ¡D]8}|j|dkrl||}t |‡fdd„d} | | ¡qln,‡fdd „t  ˆ¡Dƒ}t |‡fd d„d}|S) zR Determine a minimal set of nodes such that the entire graph is reachable cSsi|] }|g“qSrr)r ÚsnrrrrorCz!_find_sources..Úmappingrcs ˆj|S©N)Ú in_degree©Ún©rMrrrBzrCz_find_sources..©Úkeycs g|]}t|‡fdd„d‘qS)cs ˆj|Srw©Zdegreeryr{rrrB€rCz*_find_sources...r|)Úmin)r Úccr{rrr@sÿz!_find_sources..cs ˆj|Srwr~ryr{rrrBƒrC) rQr8ÚnxZstrongly_connected_componentsZ condensationrKrMr[rxrZconnected_componentsÚsorted) rMZsccsZ scc_graphZsupernode_to_nodesrvrzrur_Zsccr4rr{rrVbs&     þrVcCstd}t |t¡t|jƒdkr2t |¡s2t d¡‚g}|durF|j}n|}t |||||dd|durpd  |¡SdS)uCreates a nice utf8 representation of a forest This function has been superseded by :func:`nx.readwrite.text.generate_network_text`, which should be used instead. Parameters ---------- graph : nx.DiGraph | nx.Graph Graph to represent (must be a tree, forest, or the empty graph) with_labels : bool If True will use the "label" attribute of a node to display if it exists otherwise it will use the node value itself. Defaults to True. sources : List Mainly relevant for undirected forests, specifies which nodes to list first. If unspecified the root nodes of each tree will be used for directed forests; for undirected forests this defaults to the nodes with the smallest degree. write : callable Function to use to write to, if None new lines are appended to a list and returned. If set to the `print` function, lines will be written to stdout as they are generated. If specified, this function will return None. Defaults to None. ascii_only : Boolean If True only ASCII characters are used to construct the visualization Returns ------- str | None : utf8 representation of the tree / forest Examples -------- >>> graph = nx.balanced_tree(r=2, h=3, create_using=nx.DiGraph) >>> print(nx.forest_str(graph)) ╙── 0 ├─╼ 1 │ ├─╼ 3 │ │ ├─╼ 7 │ │ └─╼ 8 │ └─╼ 4 │ ├─╼ 9 │ └─╼ 10 └─╼ 2 ├─╼ 5 │ ├─╼ 11 │ └─╼ 12 └─╼ 6 ├─╼ 13 └─╼ 14 >>> graph = nx.balanced_tree(r=1, h=2, create_using=nx.Graph) >>> print(nx.forest_str(graph)) ╙── 0 └── 1 └── 2 >>> print(nx.forest_str(graph, ascii_only=True)) +-- 0 L-- 1 L-- 2 z‰ forest_str is deprecated as of version 3.1 and will be removed in version 3.3. Use generate_network_text or write_network_text instead. rz)input must be a forest or the empty graphNrD)r^r_rarrri) ÚwarningsÚwarnÚDeprecationWarningrUrKrZ is_forestZNetworkXNotImplementedr[rr])rMr^r_rjraÚmsgZprintbufrsrrrr‡s(Eÿ   ú rc$sÔddlm}ddlm‰m}m‰G‡‡fdd„d|ƒ}t|ƒ}d}d}g}z t|ƒ}WntyhYnf0|  |¡|d} | t j t j dt j dhvržd}n0| tj tj dtj dhvrÀd}ntd | ›ƒ‚|rät ¡} t ¡} nt ¡} t ¡} t|  ¡ƒ} t|  ¡ƒ} g}| D],‰| }‡fd d „|Dƒ}|s|  ˆ¡qg}| D],‰| }‡fd d „|Dƒ}|sJ|  ˆ¡qJ|D]V‰|  ˆ¡t‡fd d„|Dƒƒr®d}qÔn"t‡fdd„|Dƒƒr|d}qÔq||durâd}|rì| n| }d|dd}|||ƒ}g}g}d}tƒ}||ddƒg}|D]Z‰ˆ|dkrJd}q.|ˆvr°ˆ |¡\}}dd „| d¡Dƒ}| ¡}| dd¡\}‰ˆ ¡‰| ‡fdd „|Dƒ¡nˆ dd¡\}‰ˆ ¡‰| ¡}ˆ|dvrü||j|j dƒ}|  |¡q.t!|ƒ} |ˆ| dƒ}!|j"rn|!j |j kr4| ¡}qˆdkrJ|  |¡n>|  |¡|  |!¡|  |!j¡|j|ur.|  |j|!jf¡q.|r¤t!|ƒdks¤J‚|r°t#j$nt#j%}"|"ƒ}#|# &|¡|# '|¡|#S)a•Reconstructs a graph from a network text representation. This is mainly used for testing. Network text is for display, not serialization, as such this cannot parse all network text representations because node labels can be ambiguous with the glyphs and indentation used to represent edge structure. Additionally, there is no way to determine if disconnected graphs were originally directed or undirected. Parameters ---------- lines : list or iterator of strings Input data in network text format Returns ------- G: NetworkX graph The graph corresponding to the lines in network text format. r)Úchain)r1r2ÚUnioncs.eZdZU”ed<eed<”edfed<dS)z,_parse_network_text..ParseStackFramer4ÚindentNÚhas_vertical_child)rrrr#Úintr)r1rˆrrÚParseStackFrames rŒNFTzUnexpected first character: csg|]}ˆ|vr|‘qSrr©r Úother©Úitemrrr@9rCz'_parse_network_text..csg|]}ˆ|vr|‘qSrrrrrrr@?rCc3s|]}|ˆvVqdSrwr©r r©rtrrÚ ErCz&_parse_network_text..c3s|]}|ˆvVqdSrwrr‘r’rrr“HrCrOr'rArcSsg|] }| ¡‘qSr)Ústrip©r Úurrrr@prCrJr=csg|] }|ˆf‘qSrrr•)r4rrr@vrCr)z...)(Ú itertoolsr‡rPr1r2rˆÚiterÚnextÚ StopIterationr[r.rrrrÚAssertionErrorr$r r+r/r0rXÚvaluesÚanyÚobjectÚsplitÚrstripÚrsplitr”ÚextendrYr4r‰rUrŠrZDiGraphZGraphZadd_nodes_fromZadd_edges_from)$Úlinesr‡r2rŒZinitial_line_iterZis_asciirQZ initial_linesÚ first_lineÚ first_charZdirected_glyphsZundirected_glyphsZdirected_itemsZundirected_itemsZunambiguous_directed_itemsZ other_itemsZother_supersetsZunambiguous_undirected_itemsrcZbackedge_symbolZparsing_line_iterÚedgesrKZis_emptyZnoparentrdZ node_partZ backedge_partZbackedge_nodesÚprefixÚprevZ modified_prevr‰ÚcurrrÚnewr)r1rˆrrtr4rÚ_parse_network_textêsÒ     ýý         ý           r«)TNNFF)NTNNFriF)TNNF)Ú__doc__rkrƒÚ collectionsrZnetworkxrZnetworkx.utilsrÚ__all__rrr$r+r.r/r0rrrVrr«rrrrÚsD      ú _ø <% c