#NEWLINE# def out_edges( self , nbunch = None , keys = False , data = False ) : #NEWLINE# #INDENT# 'Return a list of the outgoing edges.\n\n        Edges are returned as tuples with optional data and keys\n        in the order (node, neighbor, key, 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            If True, return edge attribute dict with each edge.\n        keys : bool, optional (default=False)\n            If True, return edge keys with each edge.\n\n        Returns\n        -------\n        out_edges : list\n            An listr of (u,v), (u,v,d) or (u,v,key,d) tuples of edges.\n\n        Notes\n        -----\n        Nodes in nbunch that are not in the graph will be (quietly) ignored.\n        For directed graphs edges() is the same as out_edges().\n\n        See Also\n        --------\n        in_edges: return a list of incoming edges\n        ' #NEWLINE# return list ( self . out_edges_iter ( nbunch , keys = keys , data = self ) )