def over_bound(w_dyad, tree):
 nonzeros = sum((1 for e in w_dyad if (e != 0)))
 return ((len(tree) - lower_bound(w_dyad)) - nonzeros)

def over_bound ( w_dyad , tree ) : nonzeros = sum ( ( 1 for e in w_dyad if ( e != 0 ) ) ) return ( ( len ( tree ) - lower_bound ( w_dyad ) ) - nonzeros )
return the number of cones in the tree beyond the known lower bounds .