Runtime Scaling of Tanner Data Structure - index formation vs object linking

Parvfect / HelixWorks

Code for the Channels and Decoding Methods

0 stars 0 forks source link

Runtime Scaling of Tanner Data Structure - index formation vs object linking #4

Open Parvfect opened 8 months ago

Parvfect commented 8 months ago

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.