summaryrefslogtreecommitdiff
path: root/networkx/algorithms/centrality/current_flow_betweenness_subset.py
diff options
context:
space:
mode:
authorJarrod Millman <jarrod.millman@gmail.com>2020-09-09 17:56:24 -0700
committerJarrod Millman <jarrod.millman@gmail.com>2020-09-15 20:00:19 -0700
commit79d6620a80427726aa9d540fbb75b5aa3b8c0b37 (patch)
tree3f476bfee816ebdf4df8c7b24daa501644abd118 /networkx/algorithms/centrality/current_flow_betweenness_subset.py
parent5f2445c1b5ff4db2dd0f943e006df1a107e8f00b (diff)
downloadnetworkx-79d6620a80427726aa9d540fbb75b5aa3b8c0b37.tar.gz
Simplify imports
Diffstat (limited to 'networkx/algorithms/centrality/current_flow_betweenness_subset.py')
-rw-r--r--networkx/algorithms/centrality/current_flow_betweenness_subset.py15
1 files changed, 3 insertions, 12 deletions
diff --git a/networkx/algorithms/centrality/current_flow_betweenness_subset.py b/networkx/algorithms/centrality/current_flow_betweenness_subset.py
index a9286077..69ed32e3 100644
--- a/networkx/algorithms/centrality/current_flow_betweenness_subset.py
+++ b/networkx/algorithms/centrality/current_flow_betweenness_subset.py
@@ -88,13 +88,8 @@ def current_flow_betweenness_centrality_subset(
M. E. J. Newman, Social Networks 27, 39-54 (2005).
"""
from networkx.utils import reverse_cuthill_mckee_ordering
+ import numpy as np
- try:
- import numpy as np
- except ImportError as e:
- raise ImportError(
- "current_flow_betweenness_centrality requires NumPy ", "http://numpy.org/"
- ) from e
if not nx.is_connected(G):
raise nx.NetworkXError("Graph not connected.")
n = G.number_of_nodes()
@@ -198,12 +193,8 @@ def edge_current_flow_betweenness_centrality_subset(
.. [2] A measure of betweenness centrality based on random walks,
M. E. J. Newman, Social Networks 27, 39-54 (2005).
"""
- try:
- import numpy as np
- except ImportError as e:
- raise ImportError(
- "current_flow_betweenness_centrality requires NumPy " "http://numpy.org/"
- ) from e
+ import numpy as np
+
if not nx.is_connected(G):
raise nx.NetworkXError("Graph not connected.")
n = G.number_of_nodes()