The short answer is probably that I've probably been exposed to too much Python over the last years... The longer answer is that I am thinking of a much more general data structure than a graph of ints, or floats, or any other single type. One where general data can be stored and searched efficiently, leveraging modern graph theory for performance. (Not there yet, though...)
Regarding the Object vs ref Object it may be a misunderstanding of the concepts from my side... I was thinking of the ref as a shared data structure and the object as being copied around. For performance, I imagined that having one ref on the heap was better than copying data on the stack. But I could be wrong here, and I am glad to be enlightened by someone with more Nim experience. Thanks for the feedback.
