class_docstr: Basic weighted, directed graph class
  
  Member variables:
  
  * V (int): the number of vertices
  * E (int): the number of edges
  
  Methods
  
  * vertices (list, type=int, shape=(V,)): vertices id
  * edges (list, type=int, shape=(E,2)): edges as vertices id tuples
  * weights (list, type=int, shape=(E,)): weights / lengths
    of the graph's edges
class_docstr_tok: ["Basic","weighted",",","directed","graph","class","Member","variables",":","*","V","(","int",")",":","the","number","of","vertices","*","E","(","int",")",":","the","number","of","edges","Methods","*","vertices","(","list",",","type=int",",","shape=","(","V",",",")",")",":","vertices","id","*","edges","(","list",",","type=int",",","shape=","(","E,2",")",")",":","edges","as","vertices","id","tuples","*","weights","(","list",",","type=int",",","shape=","(","E",",",")",")",":","weights","\/","lengths","of","the","graph","'s","edges"]
docstr: anti-symmeterize self, i.e. produces the graph
  whose adjacency matrix would be the antisymmetric part of
  its current adjacency matrix
docstr_tok: ["anti-symmeterize","self",",","i.e",".","produces","the","graph","whose","adjacency","matrix","would","be","the","antisymmetric","part","of","its","current","adjacency","matrix"]
code: def anti_symmeterize(self):
      """anti-symmeterize self, i.e. produces the graph
      whose adjacency matrix would be the antisymmetric part of
      its current adjacency matrix
      """
      A = self.to_coo_matrix()
      symg = wgraph_from_adjacency((A - A.T) / 2)
      self.E = symg.E
      self.edges = symg.edges
      self.weights = symg.weights
      return self.E
  
imports: import numpy
  from scipy.sparse import coo_matrix
label_desc: Use image node_id 13 for calling the WeightedGraph obj's underlying member method code with example usage: obj.anti_symmeterize() and returns: self