Previously, much effort was spent in avoiding heap allocation, it would have required me to define every single possible node and edge type beforehand, which was extremely time consuming, blocking any future progress. Admitted defeat by using Box<T> for heap allocation, might make it slightly less efficient but allowing me to actually proceed forward in implementing other functionalities.
Previously, much effort was spent in avoiding heap allocation, it would have required me to define every single possible node and edge type beforehand, which was extremely time consuming, blocking any future progress. Admitted defeat by using
Box<T>for heap allocation, might make it slightly less efficient but allowing me to actually proceed forward in implementing other functionalities.