get_edge_data(self, u, v, default=None)
This is identical to :None:None:`G[u][v]` except the default is returned instead of an exception if the edge doesn't exist.
Value to return if the edge (u, v) is not found.
The edge attribute dictionary.
Returns the attribute dictionary associated with edge (u, v).
>>> G = nx.path_graph(4) # or DiGraph, MultiGraph, MultiDiGraph, etc
... G[0][1] {}
Warning: Assigning to :None:None:`G[u][v]` is not permitted. But it is safe to assign attributes :None:None:`G[u][v]['foo']`
>>> G[0][1]["weight"] = 7
... G[0][1]["weight"] 7
>>> G[1][0]["weight"] 7
>>> G = nx.path_graph(4) # or DiGraph, MultiGraph, MultiDiGraph, etc
... G.get_edge_data(0, 1) # default edge data is {} {}
>>> e = (0, 1)
... G.get_edge_data(*e) # tuple form {}
>>> G.get_edge_data("a", "b", default=0) # edge not in graph, return 0 0See :
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.classes.graph.Graph.get_edge_data
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