Module libpijul::graph

The data structures representing contents of a Pijul repository in memory at specific point in time. This representation is used to compute the order on the chunks of a file, possibly detecting conflicts in the process.

Structs

DFS
Graph	A graph, representing the whole content of the repository state at a point in time. The encoding is a "flat adjacency list", where each vertex contains a index children and a number of children n_children. The children of that vertex are then &g.children[children .. children + n_children].
Line	The elementary datum in the representation of the repository state at any given point in time. We need this structure (as opposed to working directly on a branch) in order to add more data, such as strongly connected component identifier, to each node.
Visits

Traits

LineBuffer

A "line outputter" trait.