src/pybel/canonicalize.py
def sort_qualified_edges(graph) -> Iterable[EdgeTuple]:
    """Return the qualified edges, sorted first by citation, then by evidence, then by annotations.

    :param BELGraph graph: A BEL graph
    """
    qualified_edges = (
        (u, v, k, d)
        for u, v, k, d in graph.edges(keys=True, data=True)
        if graph.has_edge_citation(u, v, k) and graph.has_edge_evidence(u, v, k)
    )
    return sorted(qualified_edges, key=_sort_qualified_edges_helper)
Return the qualified edges, sorted first by citation, then by evidence, then by annotations.

    :param BELGraph graph: A BEL graph
    
Return the qualified edges, sorted first by citation, then by evidence, then by annotations.
Return the qualified edges sorted first by citation then by evidence then by annotations .
def sort_qualified_edges(graph) -> Iterable[EdgeTuple]:
    qualified_edges = (
        (u, v, k, d)
        for u, v, k, d in graph.edges(keys=True, data=True)
        if graph.has_edge_citation(u, v, k) and graph.has_edge_evidence(u, v, k)
    )
    return sorted(qualified_edges, key=_sort_qualified_edges_helper)
def sort_qualified_edges ( graph ) -> Iterable [ EdgeTuple ] : qualified_edges = ( ( u , v , k , d ) for u , v , k , d in graph . edges ( keys = True , data = True ) if graph . has_edge_citation ( u , v , k ) and graph . has_edge_evidence ( u , v , k ) ) return sorted ( qualified_edges , key = _sort_qualified_edges_helper )
Return the qualified edges, sorted first by citation, then by evidence, then by annotations.
Return the qualified edges sorted first by citation then by evidence then by annotations .
"""Return the qualified edges, sorted first by citation, then by evidence, then by annotations.

    :param BELGraph graph: A BEL graph
    """
graph
A BEL graph
A BEL graph