(self, es, attributes=None)
return res
Adds some edges to the graph.

        @param es: the list of edges to be added. Every edge is represented
          with a tuple containing the vertex IDs or names of the two
          endpoints. Vertices are enumerated from zero.
        @param attributes: dict of sequences, all of length equal to the
          number of edges to be added, containing the attributes of the new
          edges.
Adds some edges to the graph.
Adds some edges to the graph .
def add_edges(self, es, attributes=None):
        """Adds some edges to the graph.

        @param es: the list of edges to be added. Every edge is represented
          with a tuple containing the vertex IDs or names of the two
          endpoints. Vertices are enumerated from zero.
        @param attributes: dict of sequences, all of length equal to the
          number of edges to be added, containing the attributes of the new
          edges.
        """
        eid = self.ecount()
        res = GraphBase.add_edges(self, es)
        n = self.ecount() - eid
        if (attributes is not None) and (n > 0):
            for key, val in list(attributes.items()):
                self.es[eid:][key] = val
        return res
def add_edges ( self , es , attributes = None ) : eid = self . ecount ( ) res = GraphBase . add_edges ( self , es ) n = self . ecount ( ) - eid if ( attributes is not None ) and ( n > 0 ) : for key , val in list ( attributes . items ( ) ) : self . es [ eid : ] [ key ] = val return res