Return the minimum degree of G.
The minimum degree of a graph is the smallest degree of any node in the graph.
Parameters: G (NetworkX graph) – An undirected graph. Returns: The minimum degree of the graph. Return type: int
>>> G = nx.path_graph(3) # Path on 3 nodes >>> nx.min_degree(G) 1