#graph #depth-first-search #breadth-first-search

nightly simple-graph

Graph library with ability to serialize/deserialize Trivial Graph Format

2 releases

0.1.1 Jan 10, 2023
0.1.0 Nov 14, 2022

#2338 in Data structures

MIT license

55KB
291 lines

simple-graph

Build Status Latest Version Documentation

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:

graphAlgorithms

Code examples?

Dependencies

~0.5–1MB
~22K SLoC