Rust implementation of Graph ADT using Adjacency List Structure
- Support only directed Graph.
- Vertices contain a variable of generic type.
- Vertices and egdes refered to using indices.
- Can be used in a wrapper struct to hide the use of these indices. See for example rs-pathfinder library.
- Add option to include a generic type to edges.
- Add option to remove vertices and edges.
- Replace indices by generational indices. This could be done using generational-arena library.
- Pierre-André Gagnon - Initial work - pag4k
- This project is licensed under the MIT License - see the LICENSE.md file for details.
- Based on Dr. Aiman Hanna COMP352 Data Structure and Algorithm course notes.