NewYour coding agent can read the release notes before it upgrades.Set up the MCP server →
Go modules · #866 by repository stars
Last release 2 years ago
no release in 18 months
Ships unpredictably
gaps range from 8 days to 13 months
Nearly every release is documented
notes for 29 of 29 stable releases
Nothing withdrawn
no release was ever pulled
4 years old
87 releases · first in 2022
One column per quarter.
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Are you using graph? Check out the graph user survey
Are you using graph? Check out the graph user survey
AllPathsBetween function for computing all paths between two vertices.Nothing published for this version
Nothing published for this version
Changed StableTopologicalSort to invoke the less function as few as possible, reducing comparisons.
StableTopologicalSort to invoke the less function as few as possible, reducing comparisons.CreatesCycle to use an optimized path if the default in-memory store is being used.Nothing published for this version
Fixed the major performance issues of StableTopologicalSort .
StableTopologicalSort.Nothing published for this version
Nothing published for this version
Fixed TopologicalSort to retain its original performance.
TopologicalSort to retain its original performance.Added the StableTopologicalSort function for deterministic topological orderings.
StableTopologicalSort function for deterministic topological orderings.VertexAttributes functional option for setting an entire vertex attributes map.Nothing published for this version
Added the BFSWithDepth function for performing a BFS with depth information.
BFSWithDepth function for performing a BFS with depth information.ErrVertexHasEdges when removing a vertex.Nothing published for this version
Nothing published for this version
Release post: graph Version 0.20 Is Out
Release post: graph Version 0.20 Is Out
Graph.AddVerticesFrom method for adding all vertices from another graph.Graph.AddEdgesFrom method for adding all edges from another graph.Graph.Edges method for obtaining all edges as a slice.Graph.UpdateEdge method for updating the properties of an edge.Store.UpdateEdge method for updating the properties of an edge.NewLike function for creating a new graph that is "like" the given graph.EdgeAttributes functional option for setting an entire edge attributes map.Graph.Clone to use the built-in in-memory store for storing vertices and edges for cloned graphs.Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Added the MinimumSpanningTree function for finding a minimum spanning tree.
MinimumSpanningTree function for finding a minimum spanning tree.MaximumSpanningTree function for finding a maximum spanning tree.Nothing published for this version
Added the Graph.RemoveVertex method for removing a vertex.
Graph.RemoveVertex method for removing a vertex.Store.RemoveVertex method for removing a vertex.ErrVertexHasEdges error instance.Union function for combining two graphs into one.Nothing published for this version
Nothing published for this version
Added the draw.GraphAttributes functional option for draw.DOT for rendering graph attributes.
draw.GraphAttributes functional option for draw.DOT for rendering graph attributes.Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Fixed ShortestPath for an edge case.
ShortestPath for an edge case.Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Fixed TransitiveReduction not to incorrectly report cycles.
TransitiveReduction not to incorrectly report cycles.This release contains breaking changes of the public API (see "Changed").
This release contains breaking changes of the public API (see "Changed").
Store interface, introducing support for custom storage implementations.NewWithStore function for explicitly initializing a graph with a Store instance.EdgeData functional option that can be used with AddEdge, introducing support for arbitrary data.Data field to EdgeProperties for retrieving data added using EdgeData.Order to additionally return an error instance (breaking change).Size to additionally return an error instance (breaking change).Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Nothing published for this version
Changed ShortestPath to return ErrTargetNotReachable if the target vertex is not reachable.
ShortestPath to return ErrTargetNotReachable if the target vertex is not reachable.ShortestPath to return correct results for large unweighted graphs.Added the ErrVertexAlreadyExists error instance. Use errors.Is to check for this instance.
ErrVertexAlreadyExists error instance. Use errors.Is to check for this instance.ErrEdgeAlreadyExists error instance. Use errors.Is to check for this instance.ErrEdgeCreatesCycle error instance. Use errors.Is to check for this instance.AddVertex to return ErrVertexAlreadyExists if the vertex already exists.VertexWithProperties to return ErrVertexNotFound if the vertex doesn't exist.AddEdge to return ErrVertexNotFound if either vertex doesn't exist.AddEdge to return ErrEdgeAlreadyExists if the edge already exists.AddEdge to return ErrEdgeCreatesCycle if cycle prevention is active and the edge would create a cycle.Edge to return ErrEdgeNotFound if the edge doesn't exist.RemoveEdge to return the error instances returned by Edge.Added the ErrVertexNotFound error instance.
ErrVertexNotFound error instance.TopologicalSort to fail at runtime when a cycle is detected.TransitiveReduction to return the transitive reduction as a new graph and fail at runtime when a cycle is detected.Vertex to return ErrVertexNotFound if the desired vertex couldn't be found.Nothing published for this version
Your coding agent can read these notes before it upgrades. Set up the MCP server →