当前位置: 首页>>代码示例>>Python>>正文


Python Algorithm.util_flood方法代码示例

本文整理汇总了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
			
开发者ID:gpleiss,项目名称:OlinMeshNetwork,代码行数:27,代码来源:GLSRalgorithm.py

示例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
			
开发者ID:gpleiss,项目名称:OlinMeshNetwork,代码行数:18,代码来源:BATMANalgorithm.py

示例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)
开发者ID:gpleiss,项目名称:OlinMeshNetwork,代码行数:20,代码来源:OWNalgorithm.py


注:本文中的algorithm.Algorithm.util_flood方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。