from_agraph(A, create_using=None)
The Graph G will have a dictionary G.graph_attr containing the default graphviz attributes for graphs, nodes and edges.
Default node attributes will be in the dictionary G.node_attr which is keyed by node.
Edge attributes will be returned as edge data in G. With edge_attr=False the edge data will be the Graphviz edge weight attribute or the value 1 if no edge weight attribute is found.
A graph created with PyGraphviz
Graph type to create. If graph instance, then cleared before populated. If :None:None:`None`, then the appropriate Graph type is inferred from A.
Returns a NetworkX Graph or DiGraph from a PyGraphviz graph.
>>> K5 = nx.complete_graph(5)See :
... A = nx.nx_agraph.to_agraph(K5)
... G = nx.nx_agraph.from_agraph(A)
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.drawing.nx_agraph.from_agraph
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