tools/android/dependency_analysis/graph.py
def sorted_edges_by_name(edges):
    """Sorts a list of edges (tuples) by their names.

    Prioritizes sorting by the first node in an edge."""
    return sorted(edges, key=lambda edge: (edge[0].name, edge[1].name))
Sorts a list of edges (tuples) by their names.

    Prioritizes sorting by the first node in an edge.
Sorts a list of edges (tuples) by their names.
Prioritizes sorting by the first node in an edge.
Sorts a list of edges ( tuples ) by their names . Prioritizes sorting by the first node in an edge .
def sorted_edges_by_name(edges):
    return sorted(edges, key=lambda edge: (edge[0].name, edge[1].name))
def sorted_edges_by_name ( edges ) : return sorted ( edges , key = lambda edge : ( edge [ 0 ] . name , edge [ 1 ] . name ) )
Sorts a list of edges (tuples) by their names.
Sorts a list of edges ( tuples ) by their names .
"""Sorts a list of edges (tuples) by their names.

    Prioritizes sorting by the first node in an edge."""
edges