number_of_edges(self, u=None, v=None)
If u and v are specified, return the number of edges between u and v. Otherwise return the total number of all edges.
The number of edges in the graph. If nodes u and v are specified return the number of edges between those nodes. If the graph is directed, this only returns the number of edges from u to v.
Returns the number of edges between two nodes.
For undirected graphs, this method counts the total number of edges in the graph:
>>> G = nx.path_graph(4)
... G.number_of_edges() 3
If you specify two nodes, this counts the total number of edges joining the two nodes:
>>> G.number_of_edges(0, 1) 1
For directed graphs, this method can count the total number of directed edges from u to v:
>>> G = nx.DiGraph()See :
... G.add_edge(0, 1)
... G.add_edge(1, 0)
... G.number_of_edges(0, 1) 1
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.classes.graph.Graph.size
networkx.classes.graph.Graph.number_of_edges
networkx.generators.sudoku.sudoku_graph
networkx.generators.classic.empty_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