graphs

Documentation

Index

• type AdjacencyList
• type Connection
• type Connections
• type DirectedGraph
  • func NewDirectedGraph() *DirectedGraph
  • func (graph *DirectedGraph) Append(key interface{})
  • func (graph *DirectedGraph) AppendAdjacencyList(adjacencies AdjacencyList)
  • func (graph *DirectedGraph) BreadthFirstSearch(startKey interface{}, callback GraphSearchCallback)
  • func (graph *DirectedGraph) Connect(fromKey, toKey interface{}, weight int)
  • func (graph *DirectedGraph) DepthFirstSearch(startKey interface{}, callback GraphSearchCallback)
  • func (graph *DirectedGraph) RouteExists(startKey, endKey interface{}) bool
  • func (graph *DirectedGraph) Vertices() VertexMap
• type Edge
  • func (edge *Edge) Reverse() *Edge
• type Graph
• type GraphSearchCallback
• type UndirectedGraph
  • func NewUndirectedGraph() *UndirectedGraph
  • func (graph *UndirectedGraph) Connect(fromKey, toKey interface{}, weight int)
• type Vertex
• type VertexMap

Types

type AdjacencyList

type AdjacencyList map[interface{}]Connections

type Connection

type Connection struct {
	Key    interface{}
	Weight int
}

type Connections

type Connections []Connection

type DirectedGraph

type DirectedGraph struct {
	// contains filtered or unexported fields
}

func NewDirectedGraph

func NewDirectedGraph() *DirectedGraph

func (*DirectedGraph) Append

func (graph *DirectedGraph) Append(key interface{})

func (*DirectedGraph) AppendAdjacencyList

func (graph *DirectedGraph) AppendAdjacencyList(adjacencies AdjacencyList)

func (*DirectedGraph) BreadthFirstSearch

func (graph *DirectedGraph) BreadthFirstSearch(startKey interface{}, callback GraphSearchCallback)

func (*DirectedGraph) Connect

func (graph *DirectedGraph) Connect(fromKey, toKey interface{}, weight int)

func (*DirectedGraph) DepthFirstSearch

func (graph *DirectedGraph) DepthFirstSearch(startKey interface{}, callback GraphSearchCallback)

func (*DirectedGraph) RouteExists

func (graph *DirectedGraph) RouteExists(startKey, endKey interface{}) bool

func (*DirectedGraph) Vertices

func (graph *DirectedGraph) Vertices() VertexMap

type Edge

type Edge struct {
	From   *Vertex
	To     *Vertex
	Weight int
}

func (*Edge) Reverse

func (edge *Edge) Reverse() *Edge

type Graph

type Graph interface {
	Vertices() VertexMap
}

type GraphSearchCallback

type GraphSearchCallback func(vertex *Vertex) bool

type UndirectedGraph

type UndirectedGraph struct {
	*DirectedGraph
}

func NewUndirectedGraph

func NewUndirectedGraph() *UndirectedGraph

func (*UndirectedGraph) Connect

func (graph *UndirectedGraph) Connect(fromKey, toKey interface{}, weight int)

type Vertex

type Vertex struct {
	Edges []*Edge
	Value interface{}
	// contains filtered or unexported fields
}

type VertexMap

type VertexMap map[interface{}]*Vertex