Fix lock

Author: adam2392

poetry.lock

@@ -70,7 +70,7 @@ optional = true
 poethepoet = "^0.16.0"
 portray = "^1.7.0"
 matplotlib = { version = "^3.5" }
-numpydoc = { version = "^1.4" }
+numpydoc = { version = "1.4" }
 pydata-sphinx-theme = { version = "^0.9.0" }
 sphinx = { version = "^5.1.1" }
 sphinxcontrib-bibtex = { version = "^2.4.2" }

pyproject.toml

@@ -112,11 +112,8 @@ def __init__(self, graphs=None, edge_types=None, **attr):
     def __str__(self):
         """Returns a short summary of the graph.
 
-        Returns
-        -------
-        info : string
-            Graph information including the graph name (if any), graph type, and the
-            number of nodes and edges.
+        Graph information including the graph name (if any), graph type, and the
+        number of nodes and edges.
 
         Examples
         --------
@@ -263,10 +260,11 @@ def has_node(self, n):
         Parameters
         ----------
         n : node
+            The node to query. Identical to ``n in G``.
 
         Returns
         -------
-        has : bool 
+        has : bool
             Whether or not the graph has node 'n'.
 
         Examples
@@ -289,11 +287,6 @@ def has_node(self, n):
     def number_of_nodes(self):
         """Returns the number of nodes in the graph.
 
-        Returns
-        -------
-        nnodes : int
-            The number of nodes in the graph.
-
         See Also
         --------
         order: identical method
@@ -310,11 +303,6 @@ def number_of_nodes(self):
     def order(self):
         """Returns the number of nodes in the graph.
 
-        Returns
-        -------
-        nnodes : int
-            The number of nodes in the graph.
-
         See Also
         --------
         number_of_nodes: identical method
@@ -348,10 +336,7 @@ def clear_edge_types(self):
     def __iter__(self):
         """Iterate over the nodes. Use: 'for n in G'.
 
-        Returns
-        -------
-        niter : iterator
-            An iterator over all nodes in the graph.
+        An iterator over all nodes in the graph.
 
         Examples
         --------
@@ -380,11 +365,6 @@ def __contains__(self, n):
     def __len__(self):
         """Returns the number of nodes in the graph. Use: 'len(G)'.
 
-        Returns
-        -------
-        nnodes : int
-            The number of nodes in the graph.
-
         See Also
         --------
         number_of_nodes: identical method
@@ -402,15 +382,7 @@ def __len__(self):
     def __getitem__(self, n):
         """Returns a dict of neighbors of node n.  Use: 'G[n]'.
 
-        Parameters
-        ----------
-        n : node
-           A node in the graph.
-
-        Returns
-        -------
-        adj_dict : dictionary
-           The adjacency dictionary for nodes connected to n.
+        The adjacency dictionary for nodes connected to n.
 
         Notes
         -----
@@ -1093,7 +1065,7 @@ def degree(self, nbunch=None, weight=None):
 
         Returns
         -------
-        deg_dicts : dictionary of DegreeView or int
+        deg_dicts : dictionary of DegreeView | int
             If multiple nodes are requested (the default), returns a ``DegreeView``
             mapping nodes to their degree.
             If a single node is requested, returns the degree of the node as an integer.
@@ -1120,7 +1092,6 @@ def size(self, weight=None, edge_type="all"):
         size : float
             The number of edges or
             (if weight keyword is provided) the total weight sum.
-
             If weight is None, returns an int. Otherwise a float
             (or more general numeric if the weights are more general).