BlueRaja / High-Speed-Priority-Queue-for-C-Sharp

A C# priority queue optimized for pathfinding applications
MIT License
1.15k stars 169 forks source link

Could the nodes be converted to structs? #19

Closed kd7uiy closed 7 years ago

kd7uiy commented 7 years ago

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#!

BlueRaja commented 7 years ago

Duplicate of #3. tl;dr you can't keep Contains(1) to be O(1) with structs.