|| at Dec 12, 2012 at 11:37 pm
I have a graph package which is incomplete but works for what I need
that you may be interested in. It's reasonably fast and makes use of a
Node/Edge interface model using an edge list representation. It the
moment it does not handle extensive node deletion/replacement well
unless you perform compaction (which will break node ID consistency).
On Wed, 2012-12-12 at 14:05 -0800, Kevin Gillette wrote:
It would be nice if Dijkstra and the others accepted an interface type with
required access methods (and could internally special-case Matrix). Many of
the graph problems I'd need to solve are very sparse, and an n^2 allocation
may be a large waste when there may only be (n,nlogn] connections,
especially if n is large.
On Wednesday, December 12, 2012 4:02:48 AM UTC-7, Peter A. Cejchan wrote:
I added some code for solving the Quadratic Assignment Problem
(Fast Ant Colony Optimization, and Tabu Search):http://go.pkgdoc.org/code.google.com/p/go-gt/gt