SimpleUnEdges storing single undirected edge-connections between nodes
SimpleDiEdges storing single directed edge-connections between nodes
MultiUnEdges storing multiple undirected edge-connections between nodes
MultiDiEdges storing multiple directed edge-connections between nodes
Predefined structures
Could we have a predefined DynGraph struct where we can create edge-lookups at runtime instead of having them pretyped in our graph struct?
Traits
We should do traits like RemovableNode which then is also implemented for cleanup for edge structs. There then should be a #[derive(LibraryNameTodoLUL)] which then implements calling RemovableNode for every field implementing it.