

def edges(self, nbunch=None, data=False):
    'Return a list of edges.\n\n        Edges are returned as tuples with optional data\n        in the order (node, neighbor, data).\n\n        Parameters\n        ----------\n        nbunch : iterable container, optional (default= all nodes)\n            A container of nodes.  The container will be iterated\n            through once.\n        data : bool, optional (default=False)\n            Return two tuples (u,v) (False) or three-tuples (u,v,data) (True).\n\n        Returns\n        --------\n        edge_list: list of edge tuples\n            Edges that are adjacent to any node in nbunch, or a list\n            of all edges if nbunch is not specified.\n\n        See Also\n        --------\n        edges_iter : return an iterator over the edges\n\n        Notes\n        -----\n        Nodes in nbunch that are not in the graph will be (quietly) ignored.\n        For directed graphs this returns the out-edges.\n\n        Examples\n        --------\n        >>> G = nx.Graph()   # or DiGraph, MultiGraph, MultiDiGraph, etc\n        >>> G.add_path([0,1,2,3])\n        >>> G.edges()\n        [(0, 1), (1, 2), (2, 3)]\n        >>> G.edges(data=True) # default edge data is {} (empty dictionary)\n        [(0, 1, {}), (1, 2, {}), (2, 3, {})]\n        >>> G.edges([0,3])\n        [(0, 1), (3, 2)]\n        >>> G.edges(0)\n        [(0, 1)]\n\n        '
    return list(data.edges_iter(nbunch, data))

dataset/ETHPy150Open networkx/networkx/networkx/classes/tests/timingclasses.py TimingGraph.edges/VarMisuse@23/556 `self`->`data`