Undirected Graphs

[ptheywood]

Inital graphs / networks implemented are directed graphs.

Undirected graphs are more memory efficient, but not always appropriate, and all undirected graphs can be represented by a directed graph with twice as many edges.

For comms, this might mean iterating two buckets rather than one.

If there is demand / use-cases where the reduced memory footprint is useful, we may wish to implement undirected graphs.