python 函数映射_Python映射函数

最新推荐文章于 2024-03-08 15:18:56 发布

大机灵聪明绝顶

最新推荐文章于 2024-03-08 15:18:56 发布

阅读量951

点赞数

文章标签： python 函数映射

本文链接：https://blog.csdn.net/weixin_34580002/article/details/113494721

版权

本文博主在使用Python map函数和节点表初始化过程中遇到问题，涉及读取网络文件、节点距离赋值和邻接节点查找。详细分析了代码错误，包括类型转换和list操作，旨在帮助初学者理解map函数的正确用法及解决常见问题。

摘要由CSDN通过智能技术生成

我需要一些关于Python的map函数的帮助。我正在尝试执行此代码，但出现错误：

更新帖子

这是我的确切代码，以及每个函数的输出：infinity = 1000000

invalid_node = -1

startNode = 0

#Values to assign to each node

class Node:

def __init__(self):

self.distFromSource = infinity

self.previous = invalid_node

self.visited = False

#read in all network nodes

#node = the distance values between nodes

def network():

f = open ('network.txt', 'r')

theNetwork = [[int(networkNode) for networkNode in line.split(',')] for line in f.readlines()]

#theNetwork = [[int(node) for node in line.split(',')] for line in f.readlines()]

print theNetwork

return theNetwork

#for each node assign default values

#populate table with default values

def populateNodeTable():

nodeTable = []

index = 0

f = open('network.txt', 'r')

for line in f:

networkNode = map(int, line.split(','))

nodeTable.append(Node())

print "The previous node is " ,nodeTable[index].previous

print "The distance from source is " ,nodeTable[index].distFromSource

#print networkNode

index +=1

nodeTable[startNode].distFromSource = 0

return nodeTable

currentNode = startNode

#find the nearest neighbour to a particular node

def nearestNeighbour(currentNode, theNetwork):

listOfNeighbours = []

nodeIndex = 0

for networkNode in theNetwork[currentNode]:

if networkNode != 0 and nodeTable[nodeIndex].visited == False:

listOfNeighbours.append(networkNode)

nodeIndex +=1

print "The nearest neighbours are", listOfNeighbours

## #print node.distFromSource, node.previous, node.visited

return listOfNeighbours

def tentativeDistance (theNetwork, listOfNeighbours):

shortestPath = []

for nodeIndex in theNetwork:

currentDistance = listOfNeighbours[nodeIndex] + startNode

print currentDistance

if currentDistance[theNetwork][nodeIndex] < Node.distFromSource:

theNetwork[node].previous = nodeIndex

theNetwork[node].distFromSource = nodeIndex

theNetwork[node].visited = True;

shortestPath.append(indexNode)

nodeIndex +=1

print shortestPath

if __name__ == "__main__":

nodeTable = populateNodeTable()

#nodeTable = populateNodeTable(self)

theNetwork = network()

#listOfNeighbours = nearestNeighbour(currentNode, theNetwork)

#tentativeDistance(theNetwork, listOfNeighbours)

我的网络功能的输出是一个二维列表：

^{pr2}$

我的populateNodeTable函数的输出是：The previous node is -1