(self, graph, kwds)
return edge_order
Returns the order in which the edge of the given graph have to be
        drawn, assuming that the relevant keyword arguments (C{edge_order} and
        C{edge_order_by}) are given in C{kwds} as a dictionary. If neither
        C{edge_order} nor C{edge_order_by} is present in C{kwds}, this
        function returns C{None} to indicate that the graph drawer is free to
        choose the most convenient edge ordering.
Returns the order in which the edge of the given graph have to be
        drawn, assuming that the relevant keyword arguments (C{edge_order} and
        C{edge_order_by}) are given in C{kwds} as a dictionary. If neither
        C{edge_order} nor C{edge_order_by} is present in C{kwds}, this
        function returns C{None} to indicate that the graph drawer is free to
        choose the most convenient edge ordering.
Returns the order in which the edge of the given graph have to be drawn assuming that the relevant keyword arguments ( C { edge_order } and C { edge_order_by } ) are given in C { kwds } as a dictionary . If neither C { edge_order } nor C { edge_order_by } is present in C { kwds } this function returns C { None } to indicate that the graph drawer is free to choose the most convenient edge ordering .
def _determine_edge_order(self, graph, kwds):
        """Returns the order in which the edge of the given graph have to be
        drawn, assuming that the relevant keyword arguments (C{edge_order} and
        C{edge_order_by}) are given in C{kwds} as a dictionary. If neither
        C{edge_order} nor C{edge_order_by} is present in C{kwds}, this
        function returns C{None} to indicate that the graph drawer is free to
        choose the most convenient edge ordering."""
        if "edge_order" in kwds:
            # Edge order specified explicitly
            return kwds["edge_order"]

        if kwds.get("edge_order_by") is None:
            # No edge order specified
            return None

        # Order edges by the value of some attribute
        edge_order_by = kwds["edge_order_by"]
        reverse = False
        if isinstance(edge_order_by, tuple):
            edge_order_by, reverse = edge_order_by
            if isinstance(reverse, str):
                reverse = reverse.lower().startswith("desc")
        attrs = graph.es[edge_order_by]
        edge_order = sorted(
            list(range(len(attrs))), key=attrs.__getitem__, reverse=bool(reverse)
        )

        return edge_order
def _determine_edge_order ( self , graph , kwds ) : if "edge_order" in kwds : # Edge order specified explicitly return kwds [ "edge_order" ] if kwds . get ( "edge_order_by" ) is None : # No edge order specified return None # Order edges by the value of some attribute edge_order_by = kwds [ "edge_order_by" ] reverse = False if isinstance ( edge_order_by , tuple ) : edge_order_by , reverse = edge_order_by if isinstance ( reverse , str ) : reverse = reverse . lower ( ) . startswith ( "desc" ) attrs = graph . es [ edge_order_by ] edge_order = sorted ( list ( range ( len ( attrs ) ) ) , key = attrs . __getitem__ , reverse = bool ( reverse ) ) return edge_order