tree_graph(data, attrs=None, ident='id', children='children')

Parameters

data : dict

Tree formatted graph data

attrs : dict

A dictionary that contains two keys 'id' and 'children'. The corresponding values provide the attribute names for storing NetworkX-internal graph data. The values should be unique. Default value: dict(id='id', children='children') .

deprecated

The :None:None:`attrs` keyword argument is replaced by :None:None:`ident` and :None:None:`children` and will be removed in networkx 3.0

ident : string

Attribute name for storing NetworkX-internal graph data. :None:None:`ident` must have a different value than children . The default is 'id'.

children : string

Attribute name for storing NetworkX-internal graph data. children must have a different value than :None:None:`ident`. The default is 'children'.

Returns

G : NetworkX DiGraph

Returns graph from tree data format.

See Also

adjacency_data

node_link_data

tree_data

Examples

>>> from networkx.readwrite import json_graph
... G = nx.DiGraph([(1, 2)])
... data = json_graph.tree_data(G, root=1)
... H = json_graph.tree_graph(data)

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.readwrite.json_graph.tree.tree_data networkx.readwrite.json_graph.tree.tree_graph

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /networkx/readwrite/json_graph/tree.py#124
type: <class 'function'>
Commit: