本文整理匯總了Python中algorithm.Algorithm.util_flood方法的典型用法代碼示例。如果您正苦於以下問題：Python Algorithm.util_flood方法的具體用法？Python Algorithm.util_flood怎麽用？Python Algorithm.util_flood使用的例子？那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在類algorithm.Algorithm的用法示例。
在下文中一共展示了Algorithm.util_flood方法的3個代碼示例，這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚，您的評價將有助於係統推薦出更棒的Python代碼示例。
示例1: repair
# 需要導入模塊: from algorithm import Algorithm [as 別名]
# 或者: from algorithm.Algorithm import util_flood [as 別名]
def repair(self):
transmissions=len(self.g.nodes()) #All the hellos.
for n in self.g.nodes():
if self.old_g.nodes().count(n)>0:
new_neighborhood=self.g.neighbors(n)
old_neighborhood=self.old_g.neighbors(n)
transmittedLSA=False
for neighbor in new_neighborhood:
if old_neighborhood.count(neighbor)==0:
(f,t)=Algorithm.util_flood(self.g,n)
transmissions+=t
transmittedLSA=True
break
if transmittedLSA:
break
for neighbor in old_neighborhood:
if new_neighborhood.count(neighbor)==0:
(f,t)=Algorithm.util_flood(self.g,n)
transmissions+=t
break
else:
(f,t)=Algorithm.util_flood(self.g, n)
transmissions+=t
self.old_g=copy.deepcopy(self.g)
return transmissions
示例2: repair
# 需要導入模塊: from algorithm import Algorithm [as 別名]
# 或者: from algorithm.Algorithm import util_flood [as 別名]
def repair(self):
#returns out a tuple of (tables, transmissions)
#call this function periodically.
self.tables={}
transmissions=0
#init tables
for node in self.g.nodes():
self.tables[node]={}
#sender_node generates an OGM
for sender_node in self.g.nodes():
(flood,t)=Algorithm.util_flood(self.g,sender_node)
transmissions+=t
for adj_node in flood.keys():
self.tables[adj_node][sender_node]=flood[adj_node]
return transmissions
示例3: find_path
# 需要導入模塊: from algorithm import Algorithm [as 別名]
# 或者: from algorithm.Algorithm import util_flood [as 別名]
def find_path(self, origin, dest):
# flood the network
transmissions=0
(flood,t)=Algorithm.util_flood(self.g,origin)
transmissions+=t
if flood.keys().count(dest)==0:
return (None,transmissions)
# generate path now
path=[dest]
currNode=dest
while currNode!=origin:
path.append(flood[currNode])
currNode=flood[currNode]
transmissions+=1
path.reverse()
return (path, transmissions)