def call_u_conflicts2(G_star, H):
glist = [G_star]
while True:
g = increment_u(G_star, glist[-1])
if gk.isedgesubset(g, H): return False, glist
if g in glist: return True, glist
glist.append(g)
return True, glist
def call_u_conflicts_d(G_star, H, checkrate=0):
glist = [G_star]
while True:
g = dincrement_u(G_star, glist[-1])
if gk.isedgesubset(g, H): return False
if g in glist: return True
glist.append(g)
return True
def call_u_conflicts2(G_star, H):
glist = [G_star]
while True:
g = increment_u(G_star, glist[-1])
if gk.isedgesubset(g, H): return False, glist
if g in glist: return True, glist
glist.append(g)
return True, glist
def call_u_conflicts_d(G_star, H, checkrate=0):
glist = [G_star]
while True:
g = dincrement_u(G_star, glist[-1])
if gk.isedgesubset(g, H): return False
if g in glist: return True
glist.append(g)
return True
def overshoot(G_star, H):
glist = [G_star]
while True:
g = increment_u(G_star, glist[-1])
if isSclique(g): return False
if gk.isedgesubset(H, g): return True
if g in glist: return False
glist.append(g)
return False
def overshoot(G_star, H):
glist = [G_star]
while True:
g = increment_u(G_star, glist[-1])
if isSclique(g): return False
if gk.isedgesubset(H, g): return True
if g in glist: return False
glist.append(g)
return False
def call_u_conflicts(G_star, H, checkrate=0):
glist = [G_star]
while True:
# g = increment_u(G_star, glist[-1])
g = directed_inc(G_star, glist[-1])
if gk.isdedgesubset(g, H): return False
g = bidirected_inc(g, glist[-1])
if gk.isedgesubset(g, H): return False
if g in glist: return True
glist.append(g)
return True
def call_u_conflicts(G_star, H, checkrate=0):
glist = [G_star]
while True:
# g = increment_u(G_star, glist[-1])
g = directed_inc(G_star, glist[-1])
if gk.isdedgesubset(g, H): return False
g = bidirected_inc(g, glist[-1])
if gk.isedgesubset(g, H): return False
if g in glist: return True
glist.append(g)
return True
