def test_look_ahead():
# Use a distance squared weight function with dependence on buyer's departure time
def weight_function_d(buyer_pos, buyer_d, seller_pos, seller_d):
bx, by = buyer_pos
sx, sy = seller_pos
return ((bx - sx)**2 + (by - sy)**2) / buyer_d / seller_d
# Test recalculating weight function (function of dep. time)
sim = Simulator(weight_function_d)
sim.print_all()
sim.add_node(pos=(0, 0), d=3, buyer=True, k=1)
sim.add_node(pos=(1, 1), d=3, buyer=False, k=2)
sim.print_all()
sim.advance(recalc_weights=True)
sim.print_all()
sim.advance(recalc_weights=True)
sim.print_all()
sim.advance(recalc_weights=True)
sim.print_all()
sim.advance(recalc_weights=True)
sim.print_all()
def test_removal():
sim = Simulator(weight_function)
sim.add_node(pos=(-1, -2), d=1, buyer=True)
sim.add_node(pos=(-2, -2), d=1, buyer=False)
print("Before removing:")
sim.print_all()
weight = sim.remove_matching(sim.n - 1, sim.n)
assert (weight == 1)
print("After removing")
sim.print_all()
print("Test removed and recorded with advance")
sim.add_node(pos=(-1, -2), d=1, buyer=True)
sim.add_node(pos=(-1, -2), d=1, buyer=True)
sim.add_node(pos=(-1, -2), d=1, buyer=False)
removed_buyers, removed_sellers = sim.advance()
assert (removed_buyers == 2)
assert (removed_sellers == 1)
def basic_tests():
# Test functionality without look ahead
# - Use a distance squared weight function
def weight_function(buyer_pos, buyer_d, seller_pos, seller_d):
bx, by = buyer_pos
sx, sy = seller_pos
return (bx - sx)**2 + (by - sy)**2
# Test adding nodes and edges, timeout after d steps
sim = Simulator(weight_function)
sim.add_node(pos=(0, 0), d=2, buyer=True)
sim.add_node(pos=(1, 1), d=2, buyer=False)
sim.print_all()
sim.advance()
sim.print_all()
sim.advance()
sim.print_all()
sim.advance()
sim.print_all()
sim.add_node(pos=(0, 0), d=1, buyer=True)
sim.add_node(pos=(1, 1), d=1, buyer=False)
sim.add_node(pos=(-1, 1), d=1, buyer=False)
sim.add_node(pos=(-1, -1), d=1, buyer=True)
sim.add_node(pos=(-1, -1), d=1, buyer=True)
sim.print_all()
sim.advance()
sim.print_all()