pack.setFlag("N") # 正常，不作修改，成功传到下一个节点
else:
pack.setFlag("D") # 代表损坏
# 各个节点按路径返回包
for j in range(len(newpath) - 1, -1, -1):
pTA = NS[path[j]].get_pTA()
pDA = NS[path[j]].get_pDA()
pRA = NS[path[j]].get_pRA()
pN = 1 - pTA - pDA - pRA
p = random.random()
if p <= pN:
continue
else:
pack.setFlag("D")
break
if pack.getFlag() == "N":
ReputationSet[pathIndex]['receiveSet'].append(pack)
#print("全新路径")
#print(newpathset)
#感知器start
#X = np.array([[3, 2, 1], [1, 1, 1], [0, 2, 1]])
#X = np.array([list(gg)])
X = None
#输出
#Y = np.array([10, 6, 7])
Y = None
Y1 = None
#整理方程式的输入start
for reputation in ReputationSet:
inputX = []
