so the gist I'm getting is that Box is for trees and Rc is for graphs
-
-
I imagine doing a cyclic graph in dotfile style: store nodes, with IDs, and store edges as a distinct set -- no direct pointers between nodes
-
Yep, that's a great way of representing graphs in Rust. Here's an example using this approach - a splay tree which is actually a cyclic graph because every node holds an ID of its parent: https://github.com/stjepang/vec-arena/blob/master/examples/splay_tree.rs …
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.