U :v fL@sdZddlZddlZddlmZddlZddlmZdddgZ Gdd d Z Gd d d e Z Gd d d e Z GdddZ Gddde ZGddde ZdddZedddddZddZd ddZdS)!z- Text-based visual representations of graphs N) defaultdict) open_file forest_strgenerate_network_textwrite_network_textc@s$eZdZdZdZdZdZdZdZdS)_AsciiBaseGlyphs+z+--  z: z| N __name__ __module__ __qualname__empty newtree_last newtree_mid endof_forest within_forest within_treerr;/tmp/pip-unpacked-wheel-_lngutwb/networkx/readwrite/text.pyrs rc@seZdZdZdZdZdS)AsciiDirectedGlyphszL-> z|-> z<-Nr r r lastmidbackedgerrrrrsrc@seZdZdZdZdZdS)AsciiUndirectedGlyphszL-- z|-- -Nrrrrrrsrc@s$eZdZdZdZdZdZdZdZdS)_UtfBaseGlyphsu╙u ╙── u ╟── r u╎ u│ Nr rrrrr#s rc@seZdZdZdZdZdS)UtfDirectedGlyphsu └─╼ u ├─╼ u╾Nrrrrrr/src@seZdZdZdZdZdS)UtfUndirectedGlyphsu └── u ├── u─Nrrrrrr5srTFc#sd}|r&|rtnt}j}j}n|r.tnt}j}j}t|t rN|n|rXdnd|dkrt|j dVnt j dkr|j Vn|dkrt }t |dfddt|Dddd} td d } t| r`| \} } } }| tk r|| k}|r| | d7<|rj| | rj| dk rjd }| t| |f}| |d }| | | |f}| |q|rrq܈| | s|r| |jg}| |jg}n| |jg}| |jg}n8|r| |jg}| |jg}n| |jg}| |jg}| tkrd}d }g}ndk r0t j | | }nt | }|rRt|| }| hn fdd|| D}|| h|dk rt | |dkr|rtg}| hfdd|| D}|r dk rdfdd|D}nddd|D}dd |j|g}nd }d |||gVt|dddD](\}}|dk}| |||f}| |q4qdS)aI Generate lines in the "network text" format 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. This notation is original to networkx, although it is simple enough that it may be known in existing literature. See #5602 for details. The procedure is summarized as follows: 1. Given a set of source nodes (which can be specified, or automatically discovered via finding the (strongly) connected components and choosing one node with minimum degree from each), we traverse the graph in depth first order. 2. Each reachable node will be printed exactly once on it's own line. 3. Edges are indicated in one of three ways: a. a parent "L-style" connection on the upper left. This corresponds to a traversal in the directed DFS tree. b. a backref "<-style" connection shown directly on the right. For directed graphs, these are drawn for any incoming edges to a node that is not a parent edge. For undirected graphs, these are drawn for only the non-parent edges that have already been represented (The edges that have not been represented will be handled in the recursive case). c. a child "L-style" connection on the lower right. Drawing of the children are handled recursively. 4. The children of each node (wrt the directed DFS tree) are drawn underneath and to the right of it. In the case that a child node has already been drawn the connection is replaced with an ellipsis ("...") to indicate that there is one or more connections represented elsewhere. 5. If a maximum depth is specified, an edge to nodes past this maximum depth will be represented by an ellipsis. Parameters ---------- graph : nx.DiGraph | nx.Graph Graph to represent 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 Yields ------ str : a line of generated text labelNrz ...cs g|]\}}d|g|kfqSNr).0idxnode)last_idxrr sz)generate_network_text..cSsdS)Nrrrrrrz'generate_network_text..TFcsg|]}|kr|qSrr)r#child) seen_nodesrrr'scsg|]}|kr|qSrrr#p)handled_parentsrrr'sz, cs"g|]}tj||qSr)strnodesgetr.)graph label_attrrrr'scSsg|] }t|qSr)r1r.rrrr's ) is_directedrrsuccpredrrZadj isinstancer1rlenr2 _find_sources enumeratersetpopEllipsisappendaddrrrrrrrr3listjoinr)r4 with_labelssources max_depth ascii_onlyr7Zglyphsr8r9stackZnum_skipped_childrenparentr%indentsZ this_islastskipZ next_islastZ try_frameZ this_prefixZ next_prefixr suffixchildrenZ other_parentsZother_parents_labelsr$r,r)r4r0r5r&r-rr;sF                           r!w c Csf|dkrtjj}n,t|dr$|j}nt|r2|}n tt|t|||||dD]}|||qPdS)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 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.generators.barbell_graph(4, 2) >>> nx.write_network_text(graph) ╙── 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 │ │ └─╼ ... │ └─╼ ... └─╼ ... Nwrite)rErFrGrH)sysstdoutrQhasattrcallable TypeErrortyper) r4pathrErFrGrHend_writelinerrrr!sv    c srtt}t|}dd|D}|jd}jD]}||}|||qDg}|D]8}|j|dkrl||}t |fddd} || qln,fdd t D}t |fd dd}|S) zR Determine a minimal set of nodes such that the entire graph is reachable cSsi|] }|gqSrr)r#snrrr sz!_find_sources..mappingrcs j|Sr") in_degreenr4rrr)r*z_find_sources..keycs g|]}t|fdddqS)cs j|Sr"Zdegreer`rbrrr)r*z*_find_sources...rc)min)r#ccrbrrr'sz!_find_sources..cs j|Sr"rer`rbrrr)r*) r7rCnxZstrongly_connected_componentsZ condensationr2r4rAr_rfZconnected_componentssorted) r4ZsccsZ scc_graphZsupernode_to_nodesr^rar\rFZsccr%rrbrr<s&     r<cCstd}t|tt|jdkr2t|s2tdg}|dkrF|j}n|}t |||||dd|dkrpd |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 graphNr+)rErFrHrYrP) warningswarnDeprecationWarningr;r2rhZ is_forestZNetworkXNotImplementedrArrD)r4rErFrQrHmsgZprintbufrZrrrrs(E    )TNNF)NTNNFrP)TNNF)__doc__rRrj collectionsrZnetworkxrhZnetworkx.utilsr__all__rrrrrrrrr<rrrrrs:      g  %