cdez/CS470-Projects
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Finished creating the dictionary of dictionaries to have all paths with their child nodes.

Browse source
This commit is contained in:
Charles Descamps 2025-02-15 00:57:04 -07:00
parent 39253dfe5e
commit 87a385d98c
1 changed files with 22 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

24
RouteFinding/05_tests.py
View file

@ -33,8 +33,28 @@ class Searcher:
nodeLoc[mapContents[nodeIter][1]] = tuple((mapContents[nodeIter][5], mapContents[nodeIter][6]))
# however, this is only taking the first node path it gets to...
# I probably need a list instead, that gets updated if the node is not in the node's child list.
nodePaths[mapContents[nodeIter][0]] = tuple((mapContents[nodeIter][1], mapContents[nodeIter][2]))
print(nodeLoc)
# check if the key exists, if it does, then add the value to the internal dictionary,
# if the internal dictionary doesn't exist, then create it and add the node.
if mapContents[nodeIter][0] not in nodePaths.keys():
nodePaths[mapContents[nodeIter][0]] = dict()
nodePaths[mapContents[nodeIter][0]][mapContents[nodeIter][1]] = mapContents[nodeIter][2]
else:
if nodePaths[mapContents[nodeIter][0]].values() not in nodePaths[mapContents[nodeIter][0]].keys():
nodePaths[mapContents[nodeIter][0]][mapContents[nodeIter][1]] = dict()
nodePaths[mapContents[nodeIter][0]][mapContents[nodeIter][1]] = mapContents[nodeIter][2]
else:
nodePaths[mapContents[nodeIter][0]][mapContents[nodeIter][1]] = mapContents[nodeIter][2]
if mapContents[nodeIter][1] not in nodePaths.keys():
nodePaths[mapContents[nodeIter][1]] = dict()
nodePaths[mapContents[nodeIter][1]][mapContents[nodeIter][0]] = mapContents[nodeIter][2]
else:
if nodePaths[mapContents[nodeIter][1]].values() not in nodePaths[mapContents[nodeIter][1]].keys():
nodePaths[mapContents[nodeIter][1]][mapContents[nodeIter][0]] = dict()
nodePaths[mapContents[nodeIter][1]][mapContents[nodeIter][0]] = mapContents[nodeIter][2]
else:
nodePaths[mapContents[nodeIter][1]][mapContents[nodeIter][0]] = mapContents[nodeIter][2]
# print(nodeLoc)
print(nodePaths)
# (b) Show your program loading in the 30-node sample file.