libswan libswan
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # Enter the code for the functions rabbitGrowth, foxGrowth, and runSimulation | |
| # in this box. | |
| def rabbitGrowth(): | |
| """ | |
| rabbitGrowth is called once at the beginning of each time step. | |
| It makes use of the global variables: CURRENTRABBITPOP and MAXRABBITPOP. | |
| The global variable CURRENTRABBITPOP is modified by this procedure. |
libswan
/ L19 PROBLEM 2
Last active
December 17, 2015 12:08
Isn't there a way to programmatically figure out the connections? E.g. Instead of "telling the program" that node[0] connects with node[1], because the position of 'A' in these two nodes is position 0, can't we figure it out programmatically?
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| nodeNameList = [] | |
| for i in nodes: | |
| nodeName = Node.getName(i) | |
| nodeNameList.append(nodeName) | |
| print nodeNameList | |
| for n in nodeNameList[0]: | |
| if nodeNameList[0].index(n) == nodeNameList[1].index(n): | |
| connectionLetter = n | |
| print connectionLetter |
OlderNewer