Pull request #244: Bugfix/test remove not inplace intermittent issue

Merge in HYP/hypernetx from bugfix/test-remove-not-inplace-intermittent-issue to develop

* commit '6ccd4783c1a5a5351898f3fb00d19ec8bb999f66':
  bump: version 2.4.2 → 2.4.3
  Adding pandas constraint
  This test is occasionally failing when checking the id of the new hypergraph against the original. This is potentially due to the original getting garbage collected and the new new hypergraph being assigned to the original. The test was rewritten to prevent garbage collecting the original hg in the test.
  bump: version 2.4.1 → 2.4.2

Author: ryandanehy

.cz.toml

@@ -1,6 +1,6 @@
 [tool.commitizen]
 name = "cz_conventional_commits"
-version = "2.4.1"
+version = "2.4.3"
 version_provider = "poetry"
 version_files = [
     "pyproject.toml",

docs/source/conf.py

@@ -19,7 +19,7 @@
 import os
 
 
-__version__ = "2.4.1"
+__version__ = "2.4.3"
 
 
 # If extensions (or modules to document with autodoc) are in another directory,

hypernetx/__init__.py

@@ -11,4 +11,4 @@
 from .utils import *
 from .utils.toys import *
 
-__version__ = "2.4.1"
+__version__ = "2.4.3"

pyproject.toml

@@ -1,6 +1,6 @@
 [tool.poetry]
 name = "hypernetx"
-version = "2.4.1"
+version = "2.4.3"
 description = "HyperNetX is a Python library for the creation and study of hypergraphs."
 authors = ["Brenda Praggastis <Brenda.Praggastis@pnnl.gov>", "Dustin Arendt <dustin.arendt@pnnl.gov>",
     "Sinan Aksoy <sinan.aksoy@pnnl.gov>", "Emilie Purvine <Emilie.Purvine@pnnl.gov>",
@@ -24,7 +24,7 @@ packages = [
 [tool.poetry.dependencies]
 python = ">=3.10,<4.0.0"
 networkx = ">=3.3"
-pandas = ">=2.2.2"
+pandas = "<3.0.0"
 scikit-learn = ">=1.4.2"
 igraph = ">=0.11.4"
 decorator = ">=5.1.1"

tests/classes/test_hypergraph.py

@@ -978,45 +978,44 @@ def test_remove_edges_nodes_incidences_inplace(triloop2):
 def test_remove_edges_nodes_incidences_not_inplace(triloop2):
     # triloop2 is a hypergraph of the following shape:
     # {AB: {A, B}, BC: {B, C}, ACD: {A, C, D, E}, ACD2: {A, C, D, E}}
-    hg = Hypergraph(triloop2.edgedict, name=triloop2.name)
+    original_hg = hg = Hypergraph(triloop2.edgedict, name=triloop2.name)
     assert hg.shape == (5, 4)
-    original_hg_id = id(hg)
     original_hg_name = hg.name
     new_name = f"{triloop2.name}_new"
 
     # removing a duplicate edge should not affect the number of nodes
     duplicate_edge = ["ACD2"]
     hg = hg.remove_edges(duplicate_edge, name=new_name, inplace=False)
     assert hg.shape == (5, 3)
-    assert id(hg) != original_hg_id
+    assert id(hg) != id(original_hg)
     assert hg.name != original_hg_name
     assert hg.name == new_name
 
     # number of nodes should drop by 1
     hg = hg.remove_nodes(["E"], name=new_name, inplace=False)
     assert hg.shape == (4, 3)
-    assert id(hg) != original_hg_id
+    assert id(hg) != id(original_hg)
     assert hg.name != original_hg_name
     assert hg.name == new_name
 
     # number of edges should drop by 1
     hg = hg.remove_edges(["ACD"], name=new_name, inplace=False)
     assert hg.shape == (3, 2)
-    assert id(hg) != original_hg_id
+    assert id(hg) != id(original_hg)
     assert hg.name != original_hg_name
     assert hg.name == new_name
 
     # remove an incidence that no longer exists; no change
     hg = hg.remove_incidences([("ACD", "E")], name=new_name, inplace=False)
     assert hg.shape == (3, 2)
-    assert id(hg) != original_hg_id
+    assert id(hg) != id(original_hg)
     assert hg.name != original_hg_name
     assert hg.name == new_name
 
     # removing the last two remaining edges will remove all the nodes from the hypergraph
     hg = hg.remove_edges(["AB", "BC"], name=new_name, inplace=False)
     assert hg.shape == (0, 0)
-    assert id(hg) != original_hg_id
+    assert id(hg) != id(original_hg)
     assert hg.name != original_hg_name
     assert hg.name == new_name