tree 0fb1e615e69db1990128301f8f9483226064abc3
parent 0df25de6539416d46d8b1ed2af8f58078cf2aa9d
author Jean-Marie Comets <jean.marie.comets@gmail.com> 1483744412 +0100
committer Jean-Marie Comets <jean.marie.comets@gmail.com> 1569668567 +0200

MatrixGraph: add initial implementation

This commit adds a `Matrix` which implements all graph traits using a
dense adjacency matrix for its underlying structure.

The matrix itself is represented as a flat array where each entry is an
edge. A node's outgoing edges are all the entries in [n..n+capacity],
the capacity being the number of nodes the matrix can hold until the
next resize.

The capacity itself is always guaranteed to be a power of two, which
helps optimize a few operations.