gonum / graph

Graph packages for the Go language [DEPRECATED]

gonum/graph Issues

graph: Atomize interfaces
Closed 6 years ago2
graph: Get rid of function overriding nonsense
Closed 6 years ago2
graph/all: consider using golang.org/x/tools/container/intsets
Closed 6 years ago2
Inline LICENSE file from github.com/gonum/license/LICENSE
Closed 6 years ago3
graph/simple: directed acyclic graph
Closed 6 years ago2
graph/simple: node retrieval from edges is subtle
Closed 6 years ago25
graph: Graph.NodeList should not demand that returned []Node be newly allocated
Closed 6 years ago19
graph: consider adding multigraph support/API
Closed 7 years ago16
graph/topo: hope to implements CyclesIn for undirect graph
Closed 7 years ago1
graph/community: undirected edge API for directed graphs is incorrectly implemented
Closed 7 years ago1
graph/community: error reporting is incorrect in TestReduceQConsistency*
Closed 7 years ago2
graph/community: add multiplex graph handling for community detection
Closed 7 years ago1
graphs/gen/batagelj_brandes.go should be renamed to erdos_renyi
Closed 7 years ago3
topo: replace ConnectedComponents implementation with union-find
Closed 7 years ago2
graphs/gen: Gnm documentation incorrect
Closed 8 years ago
community: add directed Louvain implementation
Closed 8 years ago4
simple: Self-referential nodes
Closed 8 years ago8
Paths from search
Closed 8 years ago3
Failing search
Closed 8 years ago2
{path/...,topo}: lack package doc comments
Closed 8 years ago
topo: panic messages in johnson cycles graph are wrong
Closed 9 years ago
internal: break package into conceptually related types and functions
Closed 9 years ago
internal: consider using Reflect instead of unsafe for fast path set comparison
Closed 9 years ago4
go version: drop 1.3 support
Closed 9 years ago1
Remove/Add node bug in simple.DirectedGraph
Closed 9 years ago5
simple: DirectedDenseGraph.Edge() is incorrect
Closed 9 years ago1
propose: rename concrete -> simple
Closed 9 years ago
search: Prim and Kruskal need tests
Closed 9 years ago
graph: finite graphs should have an Order() int method
Closed 9 years ago1
graph: current API is too focussed on path finding algorithms
Closed 9 years ago1
graph: edge weights should be part of the Edge type
Closed 9 years ago5
path: sort out a sensible way of sharing test cases between dynamic and static path finders
Closed 9 years ago1
all: move tests from package_test to package in many cases
Closed 9 years ago
{path,dynamic}: Consider implementing the priority queue for A* and D* Lite without map[int]int
Closed 9 years ago1
concrete: Directed.Edges is incorrect
Closed 9 years ago
Node ID return type int -> uint64
Closed 9 years ago5
concrete: use mat64.Dense and mat64.SymDense for dense graphs
Closed 9 years ago
concrete: dense graphs assume Inf is the non-edge state
Closed 9 years ago
graph: decide whether we support pseudo graphs or not
Closed 9 years ago
search: split into functionally meaningful packages
Closed 9 years ago
search: remove weight graph.CostFunc parameter from path search functions
Closed 9 years ago
search: Johnson all pairs shortest paths function returns incorrect path weights
Closed 9 years ago
topological sort
Closed 9 years ago1
search: ShortestPaths.AllBetween does not cope with zero length cycles
Closed 9 years ago
graph: remove Remove*Edge
Closed 9 years ago1
graph: Graph.AddNode is subtly unsafe
Closed 9 years ago1
all: semantics of head and tail are reversed cf. the rest of the world
Closed 9 years ago3
graph: remove Cruncher
Closed 9 years ago
search: FloydWarshall is incorrect
Closed 9 years ago
search: BronKerbosch gives sporadic failures on go tip
Closed 9 years ago2