Graph library with ability to serialize/deserialize Trivial Graph Format
This library implements structure Graph<V, E>
with adjacency list, NOT the adjacency matrix.
This feature allows to optimize memory consumption.
Besides serialize/deserialize library can deal with graph algorithms such as Depth-first search (DFS) and Breadth-first search (BFS). You can see the difference here: