Module Expr Str Import alias identifier ImportFrom alias Assign NameStore Call AttributeLoad Str attr ListLoad Str Assign NameStore ListLoad Str Str FunctionDef arguments args NameParam NameParam NameParam defaults NameLoad body Expr Str If CompareIs NameLoad NameLoad body Assign NameStore Call NameLoad NameLoad orelse Assign NameStore Call NameLoad NameLoad Assign NameStore AttributeLoad NameLoad attr For TupleStore NameStore NameStore Call AttributeLoad NameLoad attr body If CompareNotIn NameLoad NameLoad body Continue Assign NameStore Call AttributeLoad SubscriptLoad NameLoad Index NameLoad attr NameLoad NameLoad If Call AttributeLoad NameLoad attr body For TupleStore NameStore NameStore Call AttributeLoad NameLoad attr body Assign NameStore Call AttributeLoad SubscriptLoad NameLoad Index NameLoad attr NameLoad NameLoad For TupleStore NameStore NameStore Call AttributeLoad NameLoad attr body Expr Yield TupleLoad NameLoad NameLoad orelse For TupleStore NameStore NameStore Call AttributeLoad NameLoad attr body Assign NameStore Call AttributeLoad SubscriptLoad NameLoad Index NameLoad attr NameLoad NameLoad Expr Yield TupleLoad NameLoad NameLoad decorator_list FunctionDef arguments args NameParam NameParam NameParam NameParam NameParam defaults Str Str NameLoad NameLoad body Expr Str If CompareIs NameLoad NameLoad body Assign NameStore Call NameLoad NameLoad orelse Assign NameStore Call NameLoad NameLoad Assign NameStore AttributeLoad NameLoad attr Assign NameStore AttributeLoad NameLoad attr If Call AttributeLoad NameLoad attr body Assign NameStore Dict Str Str AttributeLoad NameLoad attr AttributeLoad NameLoad attr Assign NameStore SubscriptLoad NameLoad Index NameLoad Assign NameStore SubscriptLoad NameLoad Index NameLoad For TupleStore NameStore NameStore Call NameLoad NameLoad keyword NameLoad body Assign NameStore GeneratorExp NameLoad comprehension TupleStore NameStore NameStore Call AttributeLoad NameLoad attr NameLoad CompareIn NameLoad NameLoad For TupleStore NameStore NameStore Call NameLoad NameLoad keyword NameLoad body Expr Yield TupleLoad NameLoad NameLoad decorator_list FunctionDef arguments args NameParam defaults body ImportFrom alias TryExcept body Import alias handlers ExceptHandler body Raise Call NameLoad Str TryExcept body Import alias handlers ExceptHandler body Raise Call NameLoad Str decorator_list
N/A N/A Generators of  x-y pairs of node data. N/A networkx nx networkx.utils dict_to_numpy_array N/A __author__ N/A N/A join N/A Aric Hagberg <aric.hagberg@gmail.com> N/A __all__ N/A node_attribute_xy node_degree_xy node_attribute_xy N/A N/A G attribute nodes N/A None N/A N/A Return iterator of node-attribute pairs for all edges in G.

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

    attribute: key
       The node attribute key.

    nodes: list or iterable (optional)
        Use only edges that are adjacency to specified nodes.
        The default is all nodes.

    Returns
    -------
    (x,y): 2-tuple
        Generates 2-tuple of (attribute,attribute) values.

    Examples
    --------
    >>> G = nx.DiGraph()
    >>> G.add_node(1,color='red')
    >>> G.add_node(2,color='blue')
    >>> G.add_edge(1,2)
    >>> list(nx.node_attribute_xy(G,'color'))
    [('red', 'blue')]

    Notes
    -----
    For undirected graphs each edge is produced twice, once for each edge 
    representation (u,v) and (v,u), with the exception of self-loop edges 
    which only appear once.
     N/A N/A nodes None N/A N/A nodes N/A set G N/A N/A nodes N/A set nodes N/A node N/A G node N/A N/A u nbrsdict N/A N/A G adjacency N/A N/A N/A u nodes N/A N/A N/A uattr N/A N/A N/A node N/A u get attribute None N/A N/A N/A G is_multigraph N/A N/A N/A v keys N/A N/A nbrsdict items N/A N/A vattr N/A N/A N/A node N/A v get attribute None N/A N/A k d N/A N/A keys items N/A N/A N/A N/A uattr vattr N/A N/A N/A v eattr N/A N/A nbrsdict items N/A N/A vattr N/A N/A N/A node N/A v get attribute None N/A N/A N/A uattr vattr N/A node_degree_xy N/A N/A G x y weight nodes N/A out in None None N/A N/A Generate node degree-degree pairs for edges in G.

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

    x: string ('in','out')
       The degree type for source node (directed graphs only).

    y: string ('in','out')
       The degree type for target node (directed graphs only).

    weight: string or None, optional (default=None)
       The edge attribute that holds the numerical value used 
       as a weight.  If None, then each edge has weight 1.
       The degree is the sum of the edge weights adjacent to the node.

    nodes: list or iterable (optional)
        Use only edges that are adjacency to specified nodes.
        The default is all nodes.

    Returns
    -------
    (x,y): 2-tuple
        Generates 2-tuple of (degree,degree) values.


    Examples
    --------
    >>> G = nx.DiGraph()
    >>> G.add_edge(1,2)
    >>> list(nx.node_degree_xy(G,x='out',y='in'))
    [(1, 1)]
    >>> list(nx.node_degree_xy(G,x='in',y='out'))
    [(0, 0)]

    Notes
    -----
    For undirected graphs each edge is produced twice, once for each edge 
    representation (u,v) and (v,u), with the exception of self-loop edges 
    which only appear once.
     N/A N/A nodes None N/A N/A nodes N/A set G N/A N/A nodes N/A set nodes N/A xdeg N/A G degree N/A ydeg N/A G degree N/A N/A N/A G is_directed N/A N/A direction N/A out in N/A G out_degree N/A G in_degree N/A xdeg N/A direction N/A x N/A ydeg N/A direction N/A y N/A N/A u degu N/A xdeg nodes weight weight N/A N/A neighbors N/A nbr N/A N/A _ nbr N/A N/A G edges u N/A nbr nodes N/A N/A v degv N/A ydeg neighbors weight weight N/A N/A N/A N/A degu degv N/A setup_module N/A N/A module N/A N/A nose SkipTest N/A N/A N/A numpy N/A N/A N/A N/A N/A SkipTest NumPy not available N/A N/A N/A scipy N/A N/A N/A N/A N/A SkipTest SciPy not available N/A