It seems to me that the nodes are just data files. As such, it might be possible to use structs, which could use less memory and possibly be faster. My first blush look at it says it could work, but you have a better testing setup than I do.
Side node, thanks for this awesome library, it's the best PriorityQueue I've found for C#!
It seems to me that the nodes are just data files. As such, it might be possible to use structs, which could use less memory and possibly be faster. My first blush look at it says it could work, but you have a better testing setup than I do.
Side node, thanks for this awesome library, it's the best PriorityQueue I've found for C#!