I don't think flexibility and efficiency will be a problem in the case of graph algorithms but so far, it looks like making the data structures ergonomic and sa

I don't think flexibility and efficiency will be a problem in the case of graph algorithms but so far, it looks like making the data structures ergonomic and safe in the general case may be a herculean task. With LLVM inlining and other optimizations, Rust's type system allows for both flexibility and efficiency but patterns are still evolving on how to do it with complicated graph structures.