我这里有这个方法,它以字典的形式生成有向图,其中键的值是键指向的节点,即 {'stack': ['over','flow']}, stack指向溢出和流...
def generateGraph(fileName):
heroDict = {}
graph = {}
with open(fileName) as inFile:
for line in inFile:#go through each line
name_comic = line.rstrip().replace('"', '').split('\t') #split into list with name and comic book as strings
if name_comic[1] in heroDict: #if the comic book is already in the dictionary
heroDict[name_comic[1]] += [name_comic[0]] #add the hero into the comic's list of heroes
else:
heroDict.update({name_comic[1]: [name_comic[0]]}) # update dictionary with name and comic book
for i in heroDict.values():
for j in i:
if graph.has_key(j):
tempDict = copy.deepcopy(i)
tempDict.remove(j)
heroList = tempDict
graph[j] += heroList
else:
tempDict = copy.deepcopy(i)
tempDict.remove(j)
heroList = tempDict
graph[j] = heroList
print graph #<========== the graph has duplicates, ie, values that are the same as their keys are present
return graph
我的问题是,如何实现对字典的集合的使用,以防止将与所讨论的键相同的值添加到键中?