
Implements graph.Directed capable of storing at most one edge between any two nodes. Uses the Undirected implementation for space efficiency (~30% space savings).
Forked from gonum/graph@50b27dea7e to support memory-use improvements to the simple graph