fix typo

networkx · Dec 14, 2023 · 751c695 · 751c695
1 parent 6c7f40f
commit 751c695
Show file tree

Hide file tree

Showing 4 changed files with 4 additions and 4 deletions.
diff --git a/networkx/algorithms/chordal.py b/networkx/algorithms/chordal.py
@@ -331,7 +331,7 @@ def _find_chordality_breaker(G, s=None, treewidth_bound=sys.maxsize):
     if nx.number_of_selfloops(G) > 0:
         raise nx.NetworkXError("Input graph is not chordal.")
     if len(G) == 0:
-        raise nx.NetworkXError("Graph has no nodes.")
+        raise nx.NetworkXPointlessConcept("Graph has no nodes.")
     unnumbered = set(G)
     if s is None:
         s = arbitrary_element(G)

diff --git a/networkx/algorithms/dag.py b/networkx/algorithms/dag.py
@@ -589,7 +589,7 @@ def is_aperiodic(G):
     if not G.is_directed():
         raise nx.NetworkXError("is_aperiodic not defined for undirected graphs")
     if len(G) == 0:
-        raise nx.NetworkXError("Graph has no nodes.")
+        raise nx.NetworkXPointlessConcept("Graph has no nodes.")
     s = arbitrary_element(G)
     levels = {s: 0}
     this_level = [s]

diff --git a/networkx/algorithms/distance_regular.py b/networkx/algorithms/distance_regular.py
@@ -146,7 +146,7 @@ def intersection_array(G):
     """
     # test for regular graph (all degrees must be equal)
     if len(G) == 0:
-        raise nx.NetworkXError("Graph has no nodes.")
+        raise nx.NetworkXPointlessConcept("Graph has no nodes.")
     degree = iter(G.degree())
     (_, k) = next(degree)
     for _, knext in degree:

diff --git a/networkx/algorithms/regular.py b/networkx/algorithms/regular.py
@@ -29,7 +29,7 @@ def is_regular(G):
 
     """
     if len(G) == 0:
-        raise nx.NetworkXError("Graph has no nodes.")
+        raise nx.NetworkXPointlessConcept("Graph has no nodes.")
     n1 = nx.utils.arbitrary_element(G)
     if not G.is_directed():
         d1 = G.degree(n1)