Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security Policy
  
  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

concrete

package

Go to main page

Versions in this module

v1

v1.3.0-alpha.2

Jun 21, 2016

v1.3.0-alpha.1

May 25, 2016

v1.3.0-alpha.0

Apr 25, 2016

v1.2.1

Jul 14, 2016

v1.2.0

May 25, 2016

v1.2.0-rc2

Apr 23, 2016

v1.2.0-rc1

Apr 21, 2016

v1.1.6

Apr 5, 2016

v1.1.5

Mar 29, 2016

v1.1.4

Mar 14, 2016

v1.1.3

Feb 17, 2016

v1.1.2

Feb 6, 2016

v1.1.1

Jan 18, 2016

v1.0.8

Nov 7, 2015

v1.0.7

Oct 29, 2015

v1.0.6

Sep 13, 2015

v1.0.5

Aug 24, 2015

v1.0.4

Jul 29, 2015

v1.0.3

Jul 20, 2015

Changes in this version

+ type DirectedDenseGraph struct

+ func NewDirectedDenseGraph(n int, passable bool, absent float64) *DirectedDenseGraph

+ func (g *DirectedDenseGraph) Edge(u, v graph.Node) graph.Edge

+ func (g *DirectedDenseGraph) Edges() []graph.Edge

+ func (g *DirectedDenseGraph) From(n graph.Node) []graph.Node

+ func (g *DirectedDenseGraph) Has(n graph.Node) bool

+ func (g *DirectedDenseGraph) HasEdge(x, y graph.Node) bool

+ func (g *DirectedDenseGraph) HasEdgeFromTo(u, v graph.Node) bool

+ func (g *DirectedDenseGraph) Matrix() mat64.Matrix

+ func (g *DirectedDenseGraph) Nodes() []graph.Node

+ func (g *DirectedDenseGraph) RemoveEdge(e graph.Edge)

+ func (g *DirectedDenseGraph) SetEdgeWeight(e graph.Edge, weight float64)

+ func (g *DirectedDenseGraph) To(n graph.Node) []graph.Node

+ func (g *DirectedDenseGraph) Weight(e graph.Edge) float64

type DirectedGraph

+ func (g *DirectedGraph) Edge(u, v graph.Node) graph.Edge

+ func (g *DirectedGraph) Edges() []graph.Edge

+ func (g *DirectedGraph) From(n graph.Node) []graph.Node

+ func (g *DirectedGraph) Has(n graph.Node) bool

+ func (g *DirectedGraph) HasEdge(x, y graph.Node) bool

+ func (g *DirectedGraph) HasEdgeFromTo(u, v graph.Node) bool

+ func (g *DirectedGraph) NewNodeID() int

+ func (g *DirectedGraph) Node(id int) graph.Node

+ func (g *DirectedGraph) Nodes() []graph.Node

+ func (g *DirectedGraph) RemoveEdge(e graph.Edge)

+ func (g *DirectedGraph) SetEdge(e graph.Edge, cost float64)

+ func (g *DirectedGraph) To(n graph.Node) []graph.Node

+ func (g *DirectedGraph) Weight(e graph.Edge) float64

type Edge

+ F graph.Node

+ func (e Edge) From() graph.Node

+ func (e Edge) To() graph.Node

type Graph

+ func (g *Graph) Edge(u, v graph.Node) graph.Edge

+ func (g *Graph) Edges() []graph.Edge

+ func (g *Graph) From(n graph.Node) []graph.Node

+ func (g *Graph) Has(n graph.Node) bool

+ func (g *Graph) HasEdge(n, neigh graph.Node) bool

+ func (g *Graph) NewNodeID() int

+ func (g *Graph) Node(id int) graph.Node

+ func (g *Graph) Nodes() []graph.Node

+ func (g *Graph) RemoveEdge(e graph.Edge)

+ func (g *Graph) SetEdge(e graph.Edge, cost float64)

+ func (g *Graph) Weight(e graph.Edge) float64

+ type UndirectedDenseGraph struct

+ func NewUndirectedDenseGraph(n int, passable bool, absent float64) *UndirectedDenseGraph

+ func (g *UndirectedDenseGraph) Degree(n graph.Node) int

+ func (g *UndirectedDenseGraph) Edge(u, v graph.Node) graph.Edge

+ func (g *UndirectedDenseGraph) EdgeBetween(u, v graph.Node) graph.Edge

+ func (g *UndirectedDenseGraph) Edges() []graph.Edge

+ func (g *UndirectedDenseGraph) From(n graph.Node) []graph.Node

+ func (g *UndirectedDenseGraph) Has(n graph.Node) bool

+ func (g *UndirectedDenseGraph) HasEdge(u, v graph.Node) bool

+ func (g *UndirectedDenseGraph) Matrix() mat64.Matrix

+ func (g *UndirectedDenseGraph) Nodes() []graph.Node

+ func (g *UndirectedDenseGraph) RemoveEdge(e graph.Edge)

+ func (g *UndirectedDenseGraph) SetEdgeWeight(e graph.Edge, weight float64)

+ func (g *UndirectedDenseGraph) Weight(e graph.Edge) float64

v1.0.2

Jul 14, 2015

v1.0.1

Jun 30, 2015

v1.0.0

Jun 18, 2015

v0

v0.6.2

Jun 17, 2015

v0.6.1

Jun 15, 2015

v0.5.4

Jun 4, 2015

v0.5.3

May 28, 2015

v0.5.2

May 19, 2015

v0.5.1

May 13, 2015

v0.4.4

Apr 23, 2015

v0.4.3

Apr 8, 2015

Changes in this version

+ type DenseGraph struct

+ func NewDenseGraph(numNodes int, passable bool) *DenseGraph

+ func (g *DenseGraph) Cost(e graph.Edge) float64

+ func (g *DenseGraph) Crunch()

+ func (g *DenseGraph) Degree(n graph.Node) int

+ func (g *DenseGraph) DirectedEdgeList() []graph.Edge

+ func (g *DenseGraph) EdgeBetween(n, neighbor graph.Node) graph.Edge

+ func (g *DenseGraph) EdgeTo(n, succ graph.Node) graph.Edge

+ func (g *DenseGraph) Neighbors(n graph.Node) []graph.Node

+ func (g *DenseGraph) NodeExists(n graph.Node) bool

+ func (g *DenseGraph) NodeList() []graph.Node

+ func (g *DenseGraph) Predecessors(n graph.Node) []graph.Node

+ func (g *DenseGraph) RemoveEdge(e graph.Edge, directed bool)

+ func (g *DenseGraph) SetEdgeCost(e graph.Edge, cost float64, directed bool)

+ func (g *DenseGraph) Successors(n graph.Node) []graph.Node

+ type DirectedGraph struct

+ func NewDirectedGraph() *DirectedGraph

+ func (g *DirectedGraph) AddDirectedEdge(e graph.Edge, cost float64)

+ func (g *DirectedGraph) AddNode(n graph.Node)

+ func (g *DirectedGraph) Cost(e graph.Edge) float64

+ func (g *DirectedGraph) Degree(n graph.Node) int

+ func (g *DirectedGraph) EdgeBetween(n, neigh graph.Node) graph.Edge

+ func (g *DirectedGraph) EdgeList() []graph.Edge

+ func (g *DirectedGraph) EdgeTo(n, succ graph.Node) graph.Edge

+ func (g *DirectedGraph) EmptyGraph()

+ func (g *DirectedGraph) Neighbors(n graph.Node) []graph.Node

+ func (g *DirectedGraph) NewNode() graph.Node

+ func (g *DirectedGraph) NodeExists(n graph.Node) bool

+ func (g *DirectedGraph) NodeList() []graph.Node

+ func (g *DirectedGraph) Predecessors(n graph.Node) []graph.Node

+ func (g *DirectedGraph) RemoveDirectedEdge(e graph.Edge)

+ func (g *DirectedGraph) RemoveNode(n graph.Node)

+ func (g *DirectedGraph) Successors(n graph.Node) []graph.Node

+ type Edge struct

+ H graph.Node

+ T graph.Node

+ func (e Edge) Head() graph.Node

+ func (e Edge) Tail() graph.Node

+ type Graph struct

+ func NewGraph() *Graph

+ func (g *Graph) AddNode(n graph.Node)

+ func (g *Graph) AddUndirectedEdge(e graph.Edge, cost float64)

+ func (g *Graph) Cost(e graph.Edge) float64

+ func (g *Graph) Degree(n graph.Node) int

+ func (g *Graph) EdgeBetween(n, neigh graph.Node) graph.Edge

+ func (g *Graph) EdgeList() []graph.Edge

+ func (g *Graph) EmptyGraph()

+ func (g *Graph) Neighbors(n graph.Node) []graph.Node

+ func (g *Graph) NewNode() graph.Node

+ func (g *Graph) NodeExists(n graph.Node) bool

+ func (g *Graph) NodeList() []graph.Node

+ func (g *Graph) RemoveNode(n graph.Node)

+ func (g *Graph) RemoveUndirectedEdge(e graph.Edge)

+ type Node int

+ func (n Node) ID() int

+ type TileGraph struct

+ func GenerateTileGraph(template string) (*TileGraph, error)

+ func NewTileGraph(dimX, dimY int, isPassable bool) *TileGraph

+ func (g *TileGraph) CoordsToID(row, col int) int

+ func (g *TileGraph) CoordsToNode(row, col int) graph.Node

+ func (g *TileGraph) Cost(e graph.Edge) float64

+ func (g *TileGraph) Degree(n graph.Node) int

+ func (g *TileGraph) Dimensions() (rows, cols int)

+ func (g *TileGraph) EdgeBetween(n, neigh graph.Node) graph.Edge

+ func (g *TileGraph) EdgeList() []graph.Edge

+ func (g *TileGraph) IDToCoords(id int) (row, col int)

+ func (g *TileGraph) Neighbors(n graph.Node) []graph.Node

+ func (g *TileGraph) NodeExists(n graph.Node) bool

+ func (g *TileGraph) NodeList() []graph.Node

+ func (g *TileGraph) PathString(path []graph.Node) string

+ func (g *TileGraph) SetPassability(row, col int, passability bool)

+ func (g *TileGraph) String() string

+ type WeightedEdge struct

+ Cost float64