search

gonum / graph

Graph packages for the Go language [DEPRECATED]
250 stars 39 forks source link

graph/simple: directed acyclic graph #201

Closed liggitt closed 5 years ago

liggitt commented 7 years ago

A space-efficient directed acyclic graph implementation would be very welcome.

I have an implementation of a DAG on top of the simple.Undirected implementation, with From and To implementations that filter the edges returned based on whether they were from or to the specified node. In benchmarks of large graphs, it resulted in ~30% memory savings over the simple.Directed impl, since it didn't have to double-track edges.

kortschak commented 7 years ago

Please send a PR so that we can see what you are doing. Note that the design of the graph packages is such that there is no reason other than convenience to use the simple package provided graphs.

kortschak commented 5 years ago

@liggitt If you are still interested in adding this, please send the PR to gonum/gonum.

This is an issue clean-up for the deprecation of this repo.