anchor.diff:  	     (e2 (cdr second)))
   
   	  (setf (bmg:goodness e1)
  -	      (/ 1 (+ (/ 1 (max (bmg:goodness e1)) (/ 1 (bmg:goodness e2))))))
  +		(combine-parallel-edge-weights
  +		 (mapcar #'bmg:goodness (list e1 e2))))
  +
   	  (bmg:remove-edge e2)
   	  (incf removed))))
       removed))
  
positive.code: 		 (bmg:remove-node graph current-node)
  		 (incf removed)))))
      (format *error-output* "Removed ~A dangling nodes~%" removed)))
  
  
  (defun collect-neighbors (nodes)
    "Collects all the neighboring nodes of given list of nodes."
  
negative.code: 	   (remove-serial-node graph (first candidates))))))
  
  
  (defun combine-parallel-edge-weights (weights)
    (- 1 (apply #'* (mapcar #'(lambda (weight) (- 1 weight)) weights))))
  
  
  (defun remove-parallel-edges-helper (graph)
    (let*
        ((removed 0)
  