graphit/graph.py
def iteredges(self, orm_cls=None, reverse=False, sort_key=str):
        """
        Graph edge iterator
        
        Returns a new graph view object for the given edge and it's nodes.
        
        :param orm_cls:  custom classes to construct new Graph class from for
                         every edge that is returned
        :type orm_cls:   list
        :param reverse:  switch between ascending and descending sort order of
                         the returned edges
        :type reverse:   :py:bool
        :param sort_key: function for sorting edge IDs. Equivalent to the 'key'
                         argument to Pythons 'sorted' build in function.

        :return:         single edge Graph object
        :rtype:          :graphit:Graph
        """
        
        for edge in sorted(self.edges.keys(), reverse=reverse, key=sort_key):
            yield self.getedges(edge, orm_cls=orm_cls)

        Graph edge iterator
        
        Returns a new graph view object for the given edge and it's nodes.
        
        :param orm_cls:  custom classes to construct new Graph class from for
                         every edge that is returned
        :type orm_cls:   list
        :param reverse:  switch between ascending and descending sort order of
                         the returned edges
        :type reverse:   :py:bool
        :param sort_key: function for sorting edge IDs. Equivalent to the 'key'
                         argument to Pythons 'sorted' build in function.

        :return:         single edge Graph object
        :rtype:          :graphit:Graph
        
Graph edge iterator
Returns a new graph view object for the given edge and it's nodes.
Graph edge iterator Returns a new graph view object for the given edge and it ' s nodes .
def iteredges(self, orm_cls=None, reverse=False, sort_key=str):
        for edge in sorted(self.edges.keys(), reverse=reverse, key=sort_key):
            yield self.getedges(edge, orm_cls=orm_cls)
def iteredges ( self , orm_cls = None , reverse = False , sort_key = str ) : for edge in sorted ( self . edges . keys ( ) , reverse = reverse , key = sort_key ) : yield self . getedges ( edge , orm_cls = orm_cls )
Graph edge iterator
Returns a new graph view object for the given edge and it's nodes.
Graph edge iterator Returns a new graph view object for the given edge and it ' s nodes .
"""
        Graph edge iterator
        
        Returns a new graph view object for the given edge and it's nodes.
        
        :param orm_cls:  custom classes to construct new Graph class from for
                         every edge that is returned
        :type orm_cls:   list
        :param reverse:  switch between ascending and descending sort order of
                         the returned edges
        :type reverse:   :py:bool
        :param sort_key: function for sorting edge IDs. Equivalent to the 'key'
                         argument to Pythons 'sorted' build in function.

        :return:         single edge Graph object
        :rtype:          :graphit:Graph
        """
single edge Graph object
single edge Graph object
:graphit:Graph
self
orm_cls
custom classes to construct new Graph class from for
every edge that is returned
custom classes to construct new Graph class from for every edge that is returned
reverse
switch between ascending and descending sort order of
the returned edges
switch between ascending and descending sort order of the returned edges
sort_key
function for sorting edge IDs. Equivalent to the 'key'
argument to Pythons 'sorted' build in function.
function for sorting edge IDs . Equivalent to the ' key ' argument to Pythons ' sorted ' build in function .