Any idiomatic, std-only, examples of building a graph / DAG and operating (traversing, adding/removing nodes etc) it? Most implementations look different from each other which makes me think there isn't really a good example of it in std-only Rust.
21