This is a simple Rust library for graphs. It includes a depth first iterator, as well as an implementation of shortest path. The inspiration for the implementation of shortest path is from
- Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L. and Stein, Clifford. Introduction to Algorithms. 2nd : The MIT Press, 2001.