CloneSet67

Bio/Pathway/Rep/Graph.py

Bio/Pathway/Rep/MultiGraph.py

        "Removes node and all edges connected to it." 
        if node not in self.__adjacency_list: 
             raise ValueError("Unknown node: "+str(node)) 
         # remove node (and all out-edges) from adjacency list
        del self.__adjacency_list[node] 
        # remove all in-edges from adjacency list
        for n in self.__adjacency_list.keys( ):
                                              
            self.__adjacency_list[n] = HashSet(filter( lambda x,node = node:x is not node,self.__adjacency_list[n].list( ))) 

        # remove all refering pairs in label map
        for label in self.__label_map.keys( ):
                                             
            lm = HashSet(filter( lambda x,node = node:(x[0] is not node) and (x[1] is not node),self.__label_map[label].list( ))) 


            # remove the entry completely if the label is now unused
            if lm.empty( ):
                          
                del self.__label_map[label] 
            else: 
                 self.__label_map[label] = lm 
         # remove all refering entries in edge map
            

        "Removes node and all edges connected to it." 
        if node not in self.__adjacency_list: 
             raise ValueError("Unknown node: "+str(node)) 
         # remove node (and all out-edges) from adjacency list
        del self.__adjacency_list[node] 
        # remove all in-edges from adjacency list
        for n in self.__adjacency_list.keys( ):
                                              
            self.__adjacency_list[n] = HashSet(filter( lambda x,node = node:x[0] is not node,self.__adjacency_list[n].list( ))) 

        # remove all refering pairs in label map
        for label in self.__label_map.keys( ):
                                             
            lm = HashSet(filter( lambda x,node = node:(x[0] is not node) and (x[1] is not node),self.__label_map[label].list( ))) 


            # remove the entry completely if the label is now unused
            if lm.empty( ):
                          
                del self.__label_map[label] 
            else: 
                 self.__label_map[label] = lm 
            

"Removes node and all edges connected to it." 
if node not in self.__adjacency_list:
  raise ValueError("Unknown node: "+str(node)) 
  # remove node (and all out-edges) from adjacency list
del self.__adjacency_list[node] 
# remove all in-edges from adjacency list
for n in self.__adjacency_list.keys( ):
  self.__adjacency_list[n] = HashSet(filter( lambda x,node = node: [[#variable6aef8200]]is not node,self.__adjacency_list[n].list( ))) 
  # remove all refering pairs in label map
for label in self.__label_map.keys( ):
  lm = HashSet(filter( lambda x,node = node:(x[0] is not node) and (x[1] is not node),self.__label_map[label].list( ))) 
  # remove the entry completely if the label is now unused
  if lm.empty( ):
  
    del self.__label_map[label] 
  else:
  
    self.__label_map[label] = lm 
    # remove all refering entries in edge map
  
 

x 

x[0]