Currently, Tanner Data Structure is formed using a pure adjacency list, wherein links are storing indexes and not the Nodes itself. Will storing the nodes make it quicker (save lookup time?). Python usually does not have a space issue, so could be the case. Those Nodes exist as it is.
Currently, Tanner Data Structure is formed using a pure adjacency list, wherein links are storing indexes and not the Nodes itself. Will storing the nodes make it quicker (save lookup time?). Python usually does not have a space issue, so could be the case. Those Nodes exist as it is.