0

我需要一些有关 Python 地图功能的帮助。我正在尝试执行此代码，但出现错误：

更新帖子

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

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)

我的网络函数的输出是一个二维列表：

[[0, 2, 4, 1, 6, 0, 0], [2, 0, 0, 0, 5, 0, 0], [4, 0, 0, 0, 5, 5, 0], [1, 0, 0, 0, 1, 1, 0], [6, 5, 0, 1, 0, 5, 5], [0, 0, 5, 1, 5, 0, 0], [0, 0, 0, 0, 5, 0, 0]]

我的 populateNodeTable 函数的输出是：

The previous node is  -1
The distance from source is  1000000
The previous node is  -1
The distance from source is  1000000
The previous node is  -1
The distance from source is  1000000
The previous node is  -1
The distance from source is  1000000
The previous node is  -1
The distance from source is  1000000
The previous node is  -1
The distance from source is  1000000
The previous node is  -1
The distance from source is  1000000

我的网络文本文件具有这种格式（减去行距）：

0,2,4,1,6,0,0

2,0,0,0,5,0,0

4,0,0,0,5,5,0

1,0,0,0,1,1,0

6,5,0,1,0,5,5

0,0,5,1,5,0,0

0,0,0,0,5,0,0

错误是：

currentDistance = listOfNeighbours[nodeIndex] + startNode
TypeError: list indices must be integers, not list

这是我的 listOfNeighbours 的内容，在我的另一个函数中生成：

[2, 4, 1, 6]

我不理解这方面的 Python 文档，对于初学者来说听起来并不容易

4

3 回答 3

4 
for nodeIndex in theNetwork:

不会nodeIndex迭代 中的索引，theNetwork而是迭代其元素的值。你应该使用

for nodeIndex,node in enumerate(theNetwork):
    # theNetwork[nodeIndex] is now known as node
于 2011-03-13T17:48:17.670 回答
0

通过在控制台上打印来检查您的 theNetwork 变量：

print(theNetwork)

它可以是一个列表列表，而您希望它是（为了将其各个项目用作索引）是一个整数列表。

于 2011-03-13T17:47:21.850 回答
0

listOfNeighbors 是一个列表，从零开始索引。因此，listOfNeighbors[0] = 2, listOfNeighbors[1] = 4。错误告诉您，您用作索引来访问 listOfNeighbors 中的项目的 nodeIndex 是一个列表，而不是预期的整数值。这意味着网络必须由列表组成。您可以在将值分配给 currentDistance 之前尝试“打印 nodeIndex”以查看它的组成部分。另外，我也看不到您在上述函数中定义“node”或“indexNode”的位置。

另外，澄清一下——这是您最终将传递给地图的功能吗？我在函数的任何地方都没有看到地图调用。

于 2011-03-13T17:58:08.647 回答