okstra 0.130.4 → 0.131.0

package/runtime/python/okstra_vendor/networkx/algorithms/centrality/current_flow_betweenness.py

@@ -1,364 +0,0 @@
-"""Current-flow betweenness centrality measures."""
-
-import networkx as nx
-from networkx.algorithms.centrality.flow_matrix import (
-    CGInverseLaplacian,
-    FullInverseLaplacian,
-    SuperLUInverseLaplacian,
-    flow_matrix_row,
-)
-from networkx.utils import (
-    not_implemented_for,
-    py_random_state,
-    reverse_cuthill_mckee_ordering,
-)
-
-__all__ = [
-    "current_flow_betweenness_centrality",
-    "approximate_current_flow_betweenness_centrality",
-    "edge_current_flow_betweenness_centrality",
-]
-
-
-@not_implemented_for("directed")
-@py_random_state("seed")
-@nx._dispatchable(edge_attrs="weight")
-def approximate_current_flow_betweenness_centrality(
-    G,
-    normalized=True,
-    weight=None,
-    dtype=float,
-    solver="full",
-    epsilon=0.5,
-    kmax=10000,
-    seed=None,
-    *,
-    sample_weight=1,
-):
-    r"""Compute the approximate current-flow betweenness centrality for nodes.
-
-    Approximates the current-flow betweenness centrality within absolute
-    error of epsilon with high probability [1]_.
-
-
-    Parameters
-    ----------
-    G : graph
-      A NetworkX graph
-
-    normalized : bool, optional (default=True)
-      If True the betweenness values are normalized by 2/[(n-1)(n-2)] where
-      n is the number of nodes in G.
-
-    weight : string or None, optional (default=None)
-      Key for edge data used as the edge weight.
-      If None, then use 1 as each edge weight.
-      The weight reflects the capacity or the strength of the
-      edge.
-
-    dtype : data type (float)
-      Default data type for internal matrices.
-      Set to np.float32 for lower memory consumption.
-
-    solver : string (default='full')
-       Type of linear solver to use for computing the flow matrix.
-       Options are "full" (uses most memory), "lu" (recommended), and
-       "cg" (uses least memory).
-
-    epsilon: float
-        Absolute error tolerance. Note that smaller values of `epsilon` lead to
-        higher numbers of sample pairs (``k``) and thus more computation time. The number
-        of sample pairs is approximately ``(c/epsilon)^2 * log(n)`` where ``n`` is the
-        number of nodes.
-
-    kmax: int
-       Maximum number of sample node pairs to use for approximation.
-
-    sample_weight : float (default=1)
-       Multiplicative factor for the number of sample node pairs used in approximation.
-       Higher values may improve accuracy at the expense of increased computation time.
-
-    seed : integer, random_state, or None (default)
-        Indicator of random number generation state.
-        See :ref:`Randomness<randomness>`.
-
-    Returns
-    -------
-    nodes : dictionary
-       Dictionary of nodes with betweenness centrality as the value.
-
-    See Also
-    --------
-    current_flow_betweenness_centrality
-
-    Notes
-    -----
-    The running time is $O((1/\epsilon^2)m{\sqrt k} \log n)$
-    and the space required is $O(m)$ for $n$ nodes and $m$ edges.
-
-    If the edges have a 'weight' attribute they will be used as
-    weights in this algorithm.  Unspecified weights are set to 1.
-
-    References
-    ----------
-    .. [1] Ulrik Brandes and Daniel Fleischer:
-       Centrality Measures Based on Current Flow.
-       Proc. 22nd Symp. Theoretical Aspects of Computer Science (STACS '05).
-       LNCS 3404, pp. 533-544. Springer-Verlag, 2005.
-       https://doi.org/10.1007/978-3-540-31856-9_44
-    """
-    import numpy as np
-
-    if not nx.is_connected(G):
-        raise nx.NetworkXError("Graph not connected.")
-
-    n = G.number_of_nodes()
-
-    # For small graphs (n < 3), betweenness centrality is always 0 for all nodes
-    # since no node can be "between" any pair of other nodes
-    if n < 3:
-        return dict.fromkeys(G, 0.0)
-
-    if epsilon <= 0:
-        raise nx.NetworkXError(f"Epsilon must be positive. Got {epsilon=}.")
-
-    if sample_weight <= 0:
-        raise nx.NetworkXError(f"Sample weight must be positive. Got {sample_weight=}.")
-
-    nb = (n - 1.0) * (n - 2.0)  # normalization factor
-    cstar = n * (n - 1) / nb
-    k = int(sample_weight * np.ceil((cstar / epsilon) ** 2 * np.log(n)))
-    if k > kmax:
-        msg = f"Number random pairs k>kmax ({k}>{kmax}) "
-        raise nx.NetworkXError(msg, "Increase kmax or epsilon")
-
-    solvername = {
-        "full": FullInverseLaplacian,
-        "lu": SuperLUInverseLaplacian,
-        "cg": CGInverseLaplacian,
-    }
-    ordering = list(reverse_cuthill_mckee_ordering(G))
-    # make a copy with integer labels according to rcm ordering
-    # this could be done without a copy if we really wanted to
-    H = nx.relabel_nodes(G, dict(zip(ordering, range(n))))
-    L = nx.laplacian_matrix(H, nodelist=range(n), weight=weight).asformat("csc")
-    L = L.astype(dtype)
-    C = solvername[solver](L, dtype=dtype)  # initialize solver
-    betweenness = dict.fromkeys(H, 0.0)
-    cstar2k = cstar / (2 * k)
-    for _ in range(k):
-        s, t = pair = seed.sample(range(n), 2)
-        b = np.zeros(n, dtype=dtype)
-        b[s] = 1
-        b[t] = -1
-        p = C.solve(b)
-        for v in H:
-            if v in pair:
-                continue
-            for nbr in H[v]:
-                w = H[v][nbr].get(weight, 1.0)
-                betweenness[v] += float(w * np.abs(p[v] - p[nbr]) * cstar2k)
-    if normalized:
-        factor = 1.0
-    else:
-        factor = nb / 2.0
-    # remap to original node names and "unnormalize" if required
-    return {ordering[k]: v * factor for k, v in betweenness.items()}
-
-
-@not_implemented_for("directed")
-@nx._dispatchable(edge_attrs="weight")
-def current_flow_betweenness_centrality(
-    G, normalized=True, weight=None, dtype=float, solver="full"
-):
-    r"""Compute current-flow betweenness centrality for nodes.
-
-    Current-flow betweenness centrality uses an electrical current
-    model for information spreading in contrast to betweenness
-    centrality which uses shortest paths.
-
-    Current-flow betweenness centrality is also known as
-    random-walk betweenness centrality [2]_.
-
-    Parameters
-    ----------
-    G : graph
-      A NetworkX graph
-
-    normalized : bool, optional (default=True)
-      If True the betweenness values are normalized by 2/[(n-1)(n-2)] where
-      n is the number of nodes in G.
-
-    weight : string or None, optional (default=None)
-      Key for edge data used as the edge weight.
-      If None, then use 1 as each edge weight.
-      The weight reflects the capacity or the strength of the
-      edge.
-
-    dtype : data type (float)
-      Default data type for internal matrices.
-      Set to np.float32 for lower memory consumption.
-
-    solver : string (default='full')
-       Type of linear solver to use for computing the flow matrix.
-       Options are "full" (uses most memory), "lu" (recommended), and
-       "cg" (uses least memory).
-
-    Returns
-    -------
-    nodes : dictionary
-       Dictionary of nodes with betweenness centrality as the value.
-
-    See Also
-    --------
-    approximate_current_flow_betweenness_centrality
-    betweenness_centrality
-    edge_betweenness_centrality
-    edge_current_flow_betweenness_centrality
-
-    Notes
-    -----
-    Current-flow betweenness can be computed in  $O(I(n-1)+mn \log n)$
-    time [1]_, where $I(n-1)$ is the time needed to compute the
-    inverse Laplacian.  For a full matrix this is $O(n^3)$ but using
-    sparse methods you can achieve $O(nm{\sqrt k})$ where $k$ is the
-    Laplacian matrix condition number.
-
-    The space required is $O(nw)$ where $w$ is the width of the sparse
-    Laplacian matrix.  Worse case is $w=n$ for $O(n^2)$.
-
-    If the edges have a 'weight' attribute they will be used as
-    weights in this algorithm.  Unspecified weights are set to 1.
-
-    References
-    ----------
-    .. [1] Centrality Measures Based on Current Flow.
-       Ulrik Brandes and Daniel Fleischer,
-       Proc. 22nd Symp. Theoretical Aspects of Computer Science (STACS '05).
-       LNCS 3404, pp. 533-544. Springer-Verlag, 2005.
-       https://doi.org/10.1007/978-3-540-31856-9_44
-
-    .. [2] A measure of betweenness centrality based on random walks,
-       M. E. J. Newman, Social Networks 27, 39-54 (2005).
-    """
-    if not nx.is_connected(G):
-        raise nx.NetworkXError("Graph not connected.")
-    N = G.number_of_nodes()
-    ordering = list(reverse_cuthill_mckee_ordering(G))
-    # make a copy with integer labels according to rcm ordering
-    # this could be done without a copy if we really wanted to
-    H = nx.relabel_nodes(G, dict(zip(ordering, range(N))))
-    betweenness = dict.fromkeys(H, 0.0)  # b[n]=0 for n in H
-    for row, (s, t) in flow_matrix_row(H, weight=weight, dtype=dtype, solver=solver):
-        pos = dict(zip(row.argsort()[::-1], range(N)))
-        for i in range(N):
-            betweenness[s] += (i - pos[i]) * row.item(i)
-            betweenness[t] += (N - i - 1 - pos[i]) * row.item(i)
-    if normalized:
-        nb = (N - 1.0) * (N - 2.0)  # normalization factor
-    else:
-        nb = 2.0
-    return {ordering[n]: (b - n) * 2.0 / nb for n, b in betweenness.items()}
-
-
-@not_implemented_for("directed")
-@nx._dispatchable(edge_attrs="weight")
-def edge_current_flow_betweenness_centrality(
-    G, normalized=True, weight=None, dtype=float, solver="full"
-):
-    r"""Compute current-flow betweenness centrality for edges.
-
-    Current-flow betweenness centrality uses an electrical current
-    model for information spreading in contrast to betweenness
-    centrality which uses shortest paths.
-
-    Current-flow betweenness centrality is also known as
-    random-walk betweenness centrality [2]_.
-
-    Parameters
-    ----------
-    G : graph
-      A NetworkX graph
-
-    normalized : bool, optional (default=True)
-      If True the betweenness values are normalized by 2/[(n-1)(n-2)] where
-      n is the number of nodes in G.
-
-    weight : string or None, optional (default=None)
-      Key for edge data used as the edge weight.
-      If None, then use 1 as each edge weight.
-      The weight reflects the capacity or the strength of the
-      edge.
-
-    dtype : data type (default=float)
-      Default data type for internal matrices.
-      Set to np.float32 for lower memory consumption.
-
-    solver : string (default='full')
-       Type of linear solver to use for computing the flow matrix.
-       Options are "full" (uses most memory), "lu" (recommended), and
-       "cg" (uses least memory).
-
-    Returns
-    -------
-    nodes : dictionary
-       Dictionary of edge tuples with betweenness centrality as the value.
-
-    Raises
-    ------
-    NetworkXError
-        The algorithm does not support DiGraphs.
-        If the input graph is an instance of DiGraph class, NetworkXError
-        is raised.
-
-    See Also
-    --------
-    betweenness_centrality
-    edge_betweenness_centrality
-    current_flow_betweenness_centrality
-
-    Notes
-    -----
-    Current-flow betweenness can be computed in $O(I(n-1)+mn \log n)$
-    time [1]_, where $I(n-1)$ is the time needed to compute the
-    inverse Laplacian.  For a full matrix this is $O(n^3)$ but using
-    sparse methods you can achieve $O(nm{\sqrt k})$ where $k$ is the
-    Laplacian matrix condition number.
-
-    The space required is $O(nw)$ where $w$ is the width of the sparse
-    Laplacian matrix.  Worse case is $w=n$ for $O(n^2)$.
-
-    If the edges have a 'weight' attribute they will be used as
-    weights in this algorithm.  Unspecified weights are set to 1.
-
-    References
-    ----------
-    .. [1] Centrality Measures Based on Current Flow.
-       Ulrik Brandes and Daniel Fleischer,
-       Proc. 22nd Symp. Theoretical Aspects of Computer Science (STACS '05).
-       LNCS 3404, pp. 533-544. Springer-Verlag, 2005.
-       https://doi.org/10.1007/978-3-540-31856-9_44
-
-    .. [2] A measure of betweenness centrality based on random walks,
-       M. E. J. Newman, Social Networks 27, 39-54 (2005).
-    """
-    if not nx.is_connected(G):
-        raise nx.NetworkXError("Graph not connected.")
-    N = G.number_of_nodes()
-    ordering = list(reverse_cuthill_mckee_ordering(G))
-    # make a copy with integer labels according to rcm ordering
-    # this could be done without a copy if we really wanted to
-    H = nx.relabel_nodes(G, dict(zip(ordering, range(N))))
-    edges = (tuple(sorted((u, v))) for u, v in H.edges())
-    betweenness = dict.fromkeys(edges, 0.0)
-    if normalized:
-        nb = (N - 1.0) * (N - 2.0)  # normalization factor
-    else:
-        nb = 2.0
-    for row, (e) in flow_matrix_row(H, weight=weight, dtype=dtype, solver=solver):
-        pos = dict(zip(row.argsort()[::-1], range(1, N + 1)))
-        for i in range(N):
-            betweenness[e] += (i + 1 - pos[i]) * row.item(i)
-            betweenness[e] += (N - i - pos[i]) * row.item(i)
-        betweenness[e] /= nb
-    return {(ordering[s], ordering[t]): b for (s, t), b in betweenness.items()}

package/runtime/python/okstra_vendor/networkx/algorithms/centrality/current_flow_betweenness_subset.py

@@ -1,227 +0,0 @@
-"""Current-flow betweenness centrality measures for subsets of nodes."""
-
-import networkx as nx
-from networkx.algorithms.centrality.flow_matrix import flow_matrix_row
-from networkx.utils import not_implemented_for, reverse_cuthill_mckee_ordering
-
-__all__ = [
-    "current_flow_betweenness_centrality_subset",
-    "edge_current_flow_betweenness_centrality_subset",
-]
-
-
-@not_implemented_for("directed")
-@nx._dispatchable(edge_attrs="weight")
-def current_flow_betweenness_centrality_subset(
-    G, sources, targets, normalized=True, weight=None, dtype=float, solver="lu"
-):
-    r"""Compute current-flow betweenness centrality for subsets of nodes.
-
-    Current-flow betweenness centrality uses an electrical current
-    model for information spreading in contrast to betweenness
-    centrality which uses shortest paths.
-
-    Current-flow betweenness centrality is also known as
-    random-walk betweenness centrality [2]_.
-
-    Parameters
-    ----------
-    G : graph
-      A NetworkX graph
-
-    sources: list of nodes
-      Nodes to use as sources for current
-
-    targets: list of nodes
-      Nodes to use as sinks for current
-
-    normalized : bool, optional (default=True)
-      If True the betweenness values are normalized by b=b/(n-1)(n-2) where
-      n is the number of nodes in G.
-
-    weight : string or None, optional (default=None)
-      Key for edge data used as the edge weight.
-      If None, then use 1 as each edge weight.
-      The weight reflects the capacity or the strength of the
-      edge.
-
-    dtype: data type (float)
-      Default data type for internal matrices.
-      Set to np.float32 for lower memory consumption.
-
-    solver: string (default='lu')
-       Type of linear solver to use for computing the flow matrix.
-       Options are "full" (uses most memory), "lu" (recommended), and
-       "cg" (uses least memory).
-
-    Returns
-    -------
-    nodes : dictionary
-       Dictionary of nodes with betweenness centrality as the value.
-
-    See Also
-    --------
-    approximate_current_flow_betweenness_centrality
-    betweenness_centrality
-    edge_betweenness_centrality
-    edge_current_flow_betweenness_centrality
-
-    Notes
-    -----
-    Current-flow betweenness can be computed in $O(I(n-1)+mn \log n)$
-    time [1]_, where $I(n-1)$ is the time needed to compute the
-    inverse Laplacian.  For a full matrix this is $O(n^3)$ but using
-    sparse methods you can achieve $O(nm{\sqrt k})$ where $k$ is the
-    Laplacian matrix condition number.
-
-    The space required is $O(nw)$ where $w$ is the width of the sparse
-    Laplacian matrix.  Worse case is $w=n$ for $O(n^2)$.
-
-    If the edges have a 'weight' attribute they will be used as
-    weights in this algorithm.  Unspecified weights are set to 1.
-
-    References
-    ----------
-    .. [1] Centrality Measures Based on Current Flow.
-       Ulrik Brandes and Daniel Fleischer,
-       Proc. 22nd Symp. Theoretical Aspects of Computer Science (STACS '05).
-       LNCS 3404, pp. 533-544. Springer-Verlag, 2005.
-       https://doi.org/10.1007/978-3-540-31856-9_44
-
-    .. [2] A measure of betweenness centrality based on random walks,
-       M. E. J. Newman, Social Networks 27, 39-54 (2005).
-    """
-    import numpy as np
-
-    from networkx.utils import reverse_cuthill_mckee_ordering
-
-    if not nx.is_connected(G):
-        raise nx.NetworkXError("Graph not connected.")
-    N = G.number_of_nodes()
-    ordering = list(reverse_cuthill_mckee_ordering(G))
-    # make a copy with integer labels according to rcm ordering
-    # this could be done without a copy if we really wanted to
-    mapping = dict(zip(ordering, range(N)))
-    H = nx.relabel_nodes(G, mapping)
-    betweenness = dict.fromkeys(H, 0.0)  # b[n]=0 for n in H
-    for row, (s, t) in flow_matrix_row(H, weight=weight, dtype=dtype, solver=solver):
-        for ss in sources:
-            i = mapping[ss]
-            for tt in targets:
-                j = mapping[tt]
-                betweenness[s] += 0.5 * abs(row.item(i) - row.item(j))
-                betweenness[t] += 0.5 * abs(row.item(i) - row.item(j))
-    if normalized:
-        nb = (N - 1.0) * (N - 2.0)  # normalization factor
-    else:
-        nb = 2.0
-    for node in H:
-        betweenness[node] = betweenness[node] / nb + 1.0 / (2 - N)
-    return {ordering[node]: value for node, value in betweenness.items()}
-
-
-@not_implemented_for("directed")
-@nx._dispatchable(edge_attrs="weight")
-def edge_current_flow_betweenness_centrality_subset(
-    G, sources, targets, normalized=True, weight=None, dtype=float, solver="lu"
-):
-    r"""Compute current-flow betweenness centrality for edges using subsets
-    of nodes.
-
-    Current-flow betweenness centrality uses an electrical current
-    model for information spreading in contrast to betweenness
-    centrality which uses shortest paths.
-
-    Current-flow betweenness centrality is also known as
-    random-walk betweenness centrality [2]_.
-
-    Parameters
-    ----------
-    G : graph
-      A NetworkX graph
-
-    sources: list of nodes
-      Nodes to use as sources for current
-
-    targets: list of nodes
-      Nodes to use as sinks for current
-
-    normalized : bool, optional (default=True)
-      If True the betweenness values are normalized by b=b/(n-1)(n-2) where
-      n is the number of nodes in G.
-
-    weight : string or None, optional (default=None)
-      Key for edge data used as the edge weight.
-      If None, then use 1 as each edge weight.
-      The weight reflects the capacity or the strength of the
-      edge.
-
-    dtype: data type (float)
-      Default data type for internal matrices.
-      Set to np.float32 for lower memory consumption.
-
-    solver: string (default='lu')
-       Type of linear solver to use for computing the flow matrix.
-       Options are "full" (uses most memory), "lu" (recommended), and
-       "cg" (uses least memory).
-
-    Returns
-    -------
-    nodes : dict
-       Dictionary of edge tuples with betweenness centrality as the value.
-
-    See Also
-    --------
-    betweenness_centrality
-    edge_betweenness_centrality
-    current_flow_betweenness_centrality
-
-    Notes
-    -----
-    Current-flow betweenness can be computed in $O(I(n-1)+mn \log n)$
-    time [1]_, where $I(n-1)$ is the time needed to compute the
-    inverse Laplacian.  For a full matrix this is $O(n^3)$ but using
-    sparse methods you can achieve $O(nm{\sqrt k})$ where $k$ is the
-    Laplacian matrix condition number.
-
-    The space required is $O(nw)$ where $w$ is the width of the sparse
-    Laplacian matrix.  Worse case is $w=n$ for $O(n^2)$.
-
-    If the edges have a 'weight' attribute they will be used as
-    weights in this algorithm.  Unspecified weights are set to 1.
-
-    References
-    ----------
-    .. [1] Centrality Measures Based on Current Flow.
-       Ulrik Brandes and Daniel Fleischer,
-       Proc. 22nd Symp. Theoretical Aspects of Computer Science (STACS '05).
-       LNCS 3404, pp. 533-544. Springer-Verlag, 2005.
-       https://doi.org/10.1007/978-3-540-31856-9_44
-
-    .. [2] A measure of betweenness centrality based on random walks,
-       M. E. J. Newman, Social Networks 27, 39-54 (2005).
-    """
-    import numpy as np
-
-    if not nx.is_connected(G):
-        raise nx.NetworkXError("Graph not connected.")
-    N = G.number_of_nodes()
-    ordering = list(reverse_cuthill_mckee_ordering(G))
-    # make a copy with integer labels according to rcm ordering
-    # this could be done without a copy if we really wanted to
-    mapping = dict(zip(ordering, range(N)))
-    H = nx.relabel_nodes(G, mapping)
-    edges = (tuple(sorted((u, v))) for u, v in H.edges())
-    betweenness = dict.fromkeys(edges, 0.0)
-    if normalized:
-        nb = (N - 1.0) * (N - 2.0)  # normalization factor
-    else:
-        nb = 2.0
-    for row, (e) in flow_matrix_row(H, weight=weight, dtype=dtype, solver=solver):
-        for ss in sources:
-            i = mapping[ss]
-            for tt in targets:
-                j = mapping[tt]
-                betweenness[e] += 0.5 * abs(row.item(i) - row.item(j))
-        betweenness[e] /= nb
-    return {(ordering[s], ordering[t]): value for (s, t), value in betweenness.items()}

package/runtime/python/okstra_vendor/networkx/algorithms/centrality/current_flow_closeness.py

@@ -1,96 +0,0 @@
-"""Current-flow closeness centrality measures."""
-
-import networkx as nx
-from networkx.algorithms.centrality.flow_matrix import (
-    CGInverseLaplacian,
-    FullInverseLaplacian,
-    SuperLUInverseLaplacian,
-)
-from networkx.utils import not_implemented_for, reverse_cuthill_mckee_ordering
-
-__all__ = ["current_flow_closeness_centrality", "information_centrality"]
-
-
-@not_implemented_for("directed")
-@nx._dispatchable(edge_attrs="weight")
-def current_flow_closeness_centrality(G, weight=None, dtype=float, solver="lu"):
-    """Compute current-flow closeness centrality for nodes.
-
-    Current-flow closeness centrality is variant of closeness
-    centrality based on effective resistance between nodes in
-    a network. This metric is also known as information centrality.
-
-    Parameters
-    ----------
-    G : graph
-      A NetworkX graph.
-
-    weight : None or string, optional (default=None)
-      If None, all edge weights are considered equal.
-      Otherwise holds the name of the edge attribute used as weight.
-      The weight reflects the capacity or the strength of the
-      edge.
-
-    dtype: data type (default=float)
-      Default data type for internal matrices.
-      Set to np.float32 for lower memory consumption.
-
-    solver: string (default='lu')
-       Type of linear solver to use for computing the flow matrix.
-       Options are "full" (uses most memory), "lu" (recommended), and
-       "cg" (uses least memory).
-
-    Returns
-    -------
-    nodes : dictionary
-       Dictionary of nodes with current flow closeness centrality as the value.
-
-    See Also
-    --------
-    closeness_centrality
-
-    Notes
-    -----
-    The algorithm is from Brandes [1]_.
-
-    See also [2]_ for the original definition of information centrality.
-
-    References
-    ----------
-    .. [1] Ulrik Brandes and Daniel Fleischer,
-       Centrality Measures Based on Current Flow.
-       Proc. 22nd Symp. Theoretical Aspects of Computer Science (STACS '05).
-       LNCS 3404, pp. 533-544. Springer-Verlag, 2005.
-       https://doi.org/10.1007/978-3-540-31856-9_44
-
-    .. [2] Karen Stephenson and Marvin Zelen:
-       Rethinking centrality: Methods and examples.
-       Social Networks 11(1):1-37, 1989.
-       https://doi.org/10.1016/0378-8733(89)90016-6
-    """
-    if not nx.is_connected(G):
-        raise nx.NetworkXError("Graph not connected.")
-    solvername = {
-        "full": FullInverseLaplacian,
-        "lu": SuperLUInverseLaplacian,
-        "cg": CGInverseLaplacian,
-    }
-    N = G.number_of_nodes()
-    ordering = list(reverse_cuthill_mckee_ordering(G))
-    # make a copy with integer labels according to rcm ordering
-    # this could be done without a copy if we really wanted to
-    H = nx.relabel_nodes(G, dict(zip(ordering, range(N))))
-    betweenness = dict.fromkeys(H, 0.0)  # b[n]=0 for n in H
-    N = H.number_of_nodes()
-    L = nx.laplacian_matrix(H, nodelist=range(N), weight=weight).asformat("csc")
-    L = L.astype(dtype)
-    C2 = solvername[solver](L, width=1, dtype=dtype)  # initialize solver
-    for v in H:
-        col = C2.get_row(v)
-        for w in H:
-            betweenness[v] += col.item(v) - 2 * col.item(w)
-            betweenness[w] += col.item(v)
-    return {ordering[node]: 1 / value for node, value in betweenness.items()}
-
-
-information_centrality = current_flow_closeness_centrality