本文整理汇总了Python中mesa.space.MultiGrid.get_neighbors方法的典型用法代码示例。如果您正苦于以下问题:Python MultiGrid.get_neighbors方法的具体用法?Python MultiGrid.get_neighbors怎么用?Python MultiGrid.get_neighbors使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类mesa.space.MultiGrid
的用法示例。
在下文中一共展示了MultiGrid.get_neighbors方法的2个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: TestMultiGrid
# 需要导入模块: from mesa.space import MultiGrid [as 别名]
# 或者: from mesa.space.MultiGrid import get_neighbors [as 别名]
class TestMultiGrid(unittest.TestCase):
'''
Testing a toroidal MultiGrid
'''
torus = True
def setUp(self):
'''
Create a test non-toroidal grid and populate it with Mock Agents
'''
width = 3
height = 5
self.grid = MultiGrid(width, height, self.torus)
self.agents = []
counter = 0
for x in range(width):
for y in range(height):
for i in range(TEST_MULTIGRID[x][y]):
counter += 1
# Create and place the mock agent
a = MockAgent(counter, None)
self.agents.append(a)
self.grid.place_agent(a, (x, y))
def test_agent_positions(self):
'''
Ensure that the agents are all placed properly on the MultiGrid.
'''
for agent in self.agents:
x, y = agent.pos
assert agent in self.grid[x][y]
def test_neighbors(self):
'''
Test the toroidal MultiGrid neighborhood methods.
'''
neighborhood = self.grid.get_neighborhood((1, 1), moore=True)
assert len(neighborhood) == 8
neighborhood = self.grid.get_neighborhood((1, 4), moore=True)
assert len(neighborhood) == 8
neighborhood = self.grid.get_neighborhood((0, 0), moore=False)
assert len(neighborhood) == 4
neighbors = self.grid.get_neighbors((1, 4), moore=False)
assert len(neighbors) == 0
neighbors = self.grid.get_neighbors((1, 4), moore=True)
assert len(neighbors) == 5
neighbors = self.grid.get_neighbors((1, 1), moore=False,
include_center=True)
assert len(neighbors) == 7
neighbors = self.grid.get_neighbors((1, 3), moore=False, radius=2)
assert len(neighbors) == 11
示例2: Trade
# 需要导入模块: from mesa.space import MultiGrid [as 别名]
# 或者: from mesa.space.MultiGrid import get_neighbors [as 别名]
#.........这里部分代码省略.........
self.sid_alive.append(sid)
# For entry
if self.entry == 1:
# Initialize the profitability vector
self.pi = [0] * (self.height * self.width)
elif self.entry == 2:
# Calculate the average cash balance (scalar)
total_cash = 0
cnt_seller = 0
total_cash = sum([self.sellers[sid].cash for sid in self.sid_alive])
self.avg_cash = total_cash / len(self.sid_alive)
elif self.entry == 3:
# Calculate the max cash balance (scalar)
temp_sids = self.sid_alive
cash_bals = [self.sellers[sid].cash for sid in temp_sids]
new_sellers = True
# Loops over maximal sellers until it finds one with no new firms nearby
while(new_sellers):
max_cash = max(cash_bals)
if(max_cash < self.entryThreshhold): break
max_cash_ind = cash_bals.index(max_cash)
max_sid = temp_sids[max_cash_ind]
max_x = self.sellers[max_sid].pos[0]
max_y = self.sellers[max_sid].pos[1]
if(self.entryDebug):
print("Max Cash, sid:", max_sid, ", Cell:(" + str(max_x) + ", " + str(max_y) + ")")
print("-Neighbor Ages:", end=" ")
new_sellers = False
# Check the age of all firms nearby the max cash balance firm
# (wants to avoid new firms)
for neighbor in self.grid.get_neighbors((max_x, max_y),True,True,self.entryRadius):
if(isinstance(neighbor, Seller) and self.entryDebug): print(str(neighbor.age), end=" ")
if(isinstance(neighbor, Seller) and neighbor.age < 52): new_sellers = True
if(new_sellers):
if(self.entryDebug):
print("\n-New Firm Exists Near sid: ", max_sid, ", Cell:(" + str(max_x) + ", " + str(max_y) + ")")
del temp_sids[max_cash_ind]
del cash_bals[max_cash_ind]
'''
Entry
Entry=1
Determine the most profitable position and whether to enter
Threshold: the fixed costs
Entry=2
Enter whenever Avg cash balance > entryThreshhold
Entry=3
Checks that no new firms are near the max balance seller
Enters within entryRadius units of the seller with max cash balance
'''
entry_on = False
if (self.entry == 1 and self.mktresearch):
opt = max(self.pi)
opt_pos = self.pi.index(opt)
if opt >= self.costs:
x = opt_pos // self.width
y = opt_pos % self.width
entry_on = True
elif (self.entry == 2 and self.avg_cash > self.entryThreshhold):
x = np.random.randint(self.width)