Module Expr Str Import alias identifier ImportFrom alias Assign NameStore ListLoad Str Str Str FunctionDef arguments args NameParam defaults body Expr Str Assign NameStore Dict Assign NameStore BinOpDiv Num BinOpSub Call NameLoad NameLoad Num Assign NameStore DictComp NameLoad BinOpMult NameLoad NameLoad comprehension TupleStore NameStore NameStore Call AttributeLoad NameLoad attr Return NameLoad decorator_list FunctionDef arguments args NameParam defaults body Expr Str Assign NameStore Dict Assign NameStore BinOpDiv Num BinOpSub Call NameLoad NameLoad Num Assign NameStore DictComp NameLoad BinOpMult NameLoad NameLoad comprehension TupleStore NameStore NameStore Call AttributeLoad NameLoad attr Return NameLoad decorator_list Call NameLoad Str FunctionDef arguments args NameParam defaults body Expr Str Assign NameStore Dict Assign NameStore BinOpDiv Num BinOpSub Call NameLoad NameLoad Num Assign NameStore DictComp NameLoad BinOpMult NameLoad NameLoad comprehension TupleStore NameStore NameStore Call AttributeLoad NameLoad attr Return NameLoad decorator_list Call NameLoad Str
N/A N/A Degree centrality measures. N/A networkx nx networkx.utils.decorators not_implemented_for N/A __all__ N/A degree_centrality in_degree_centrality out_degree_centrality degree_centrality N/A N/A G N/A N/A N/A Compute the degree centrality for nodes.

    The degree centrality for a node v is the fraction of nodes it
    is connected to.

    Parameters
    ----------
    G : graph
      A networkx graph

    Returns
    -------
    nodes : dictionary
       Dictionary of nodes with degree centrality as the value.

    See Also
    --------
    betweenness_centrality, load_centrality, eigenvector_centrality

    Notes
    -----
    The degree centrality values are normalized by dividing by the maximum
    possible degree in a simple graph n-1 where n is the number of nodes in G.

    For multigraphs or graphs with self loops the maximum degree might
    be higher than n-1 and values of degree centrality greater than 1
    are possible.
     N/A centrality N/A N/A s N/A 1.0 N/A N/A len G 1.0 N/A centrality N/A n N/A d s N/A N/A n d N/A N/A G degree N/A centrality N/A in_degree_centrality N/A N/A G N/A N/A N/A Compute the in-degree centrality for nodes.

    The in-degree centrality for a node v is the fraction of nodes its
    incoming edges are connected to.

    Parameters
    ----------
    G : graph
        A NetworkX graph

    Returns
    -------
    nodes : dictionary
        Dictionary of nodes with in-degree centrality as values.

    Raises
    ------
    NetworkXNotImplemented:
        If G is undirected.

    See Also
    --------
    degree_centrality, out_degree_centrality

    Notes
    -----
    The degree centrality values are normalized by dividing by the maximum
    possible degree in a simple graph n-1 where n is the number of nodes in G.

    For multigraphs or graphs with self loops the maximum degree might
    be higher than n-1 and values of degree centrality greater than 1
    are possible.
     N/A centrality N/A N/A s N/A 1.0 N/A N/A len G 1.0 N/A centrality N/A n N/A d s N/A N/A n d N/A N/A G in_degree N/A centrality N/A N/A not_implemented_for undirected out_degree_centrality N/A N/A G N/A N/A N/A Compute the out-degree centrality for nodes.

    The out-degree centrality for a node v is the fraction of nodes its
    outgoing edges are connected to.

    Parameters
    ----------
    G : graph
        A NetworkX graph

    Returns
    -------
    nodes : dictionary
        Dictionary of nodes with out-degree centrality as values.

    Raises
    ------
    NetworkXNotImplemented:
        If G is undirected.

    See Also
    --------
    degree_centrality, in_degree_centrality

    Notes
    -----
    The degree centrality values are normalized by dividing by the maximum
    possible degree in a simple graph n-1 where n is the number of nodes in G.

    For multigraphs or graphs with self loops the maximum degree might
    be higher than n-1 and values of degree centrality greater than 1
    are possible.
     N/A centrality N/A N/A s N/A 1.0 N/A N/A len G 1.0 N/A centrality N/A n N/A d s N/A N/A n d N/A N/A G out_degree N/A centrality N/A N/A not_implemented_for undirected