Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

graph

package

Go to main page

Versions in this module

v0

v0.2.4

Apr 20, 2022

v0.2.3

Aug 31, 2021

v0.2.2

Aug 25, 2021

v0.2.1

Aug 4, 2021

v0.2.0

May 12, 2021

v0.1.1

Mar 19, 2021

v0.1.0

Dec 1, 2020

Changes in this version

+ func VertexID(v Vertex) interface

+ func VertexName(v Vertex) string

+ type DFSFunc func(Vertex, func() error) error

+ type Graph struct

+ func (g *Graph) Add(v Vertex) Vertex

+ func (g *Graph) AddEdge(v1, v2 Vertex)

+ func (g *Graph) AddEdgeWeighted(v1, v2 Vertex, weight int)

+ func (g *Graph) AddOverwrite(v Vertex) Vertex

+ func (g *Graph) Copy() *Graph

+ func (g *Graph) Cycles() [][]Vertex

+ func (g *Graph) DFS(start Vertex, cb DFSFunc) error

+ func (g *Graph) Dijkstra(src Vertex) (distTo map[interface{}]int, edgeTo map[interface{}]Vertex)

+ func (g *Graph) EdgeToPath(target Vertex, edgeTo map[interface{}]Vertex) []Vertex

+ func (g *Graph) InEdges(v Vertex) []Vertex

+ func (g *Graph) KahnSort() TopoOrder

+ func (g *Graph) OutEdges(v Vertex) []Vertex

+ func (g *Graph) Remove(v Vertex) Vertex

+ func (g *Graph) RemoveEdge(v1, v2 Vertex)

+ func (g *Graph) Reverse() *Graph

+ func (g *Graph) String() string

+ func (g *Graph) StronglyConnected() [][]Vertex

+ func (g *Graph) TopoShortestPath(L TopoOrder) (distTo map[interface{}]int, edgeTo map[interface{}]Vertex)

+ func (g *Graph) Vertex(id interface{}) Vertex

+ func (g *Graph) Vertices() []Vertex

+ type TopoOrder []Vertex

+ func (t TopoOrder) At(v Vertex) TopoOrder

+ func (t TopoOrder) Until(v Vertex) TopoOrder

+ type Vertex interface

+ type VertexHashable interface

+ Hashcode func() interface{}