dijkstra

README

dijkstra

Dijkstra's shortest path - in Golang

Documentation

Index

• type Candidates
  • func (h Candidates) IsEmpty() bool
  • func (h Candidates) Len() int
  • func (h Candidates) Less(i, j int) bool
  • func (h *Candidates) Pop() (v Vertex)
  • func (h *Candidates) Push(v Vertex)
  • func (h Candidates) Swap(i, j int)
• type Edge
• type Graph
  • func NewGraph(vs map[int]Vertex) *Graph
  • func NewGraphFromFile(fn string) *Graph
  • func (g *Graph) Len() int
  • func (g *Graph) ShortestPath(src, dest int) (x int)
• type Vertex

Types

type Candidates

type Candidates []Vertex

func (Candidates) IsEmpty

func (h Candidates) IsEmpty() bool

func (Candidates) Len

func (h Candidates) Len() int

func (Candidates) Less

func (h Candidates) Less(i, j int) bool

func (*Candidates) Pop

func (h *Candidates) Pop() (v Vertex)

func (*Candidates) Push

func (h *Candidates) Push(v Vertex)

func (Candidates) Swap

func (h Candidates) Swap(i, j int)

type Edge

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

type Graph

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

func NewGraph

func NewGraph(vs map[int]Vertex) *Graph

func NewGraphFromFile

func NewGraphFromFile(fn string) *Graph

func (*Graph) Len

func (g *Graph) Len() int

func (*Graph) ShortestPath

func (g *Graph) ShortestPath(src, dest int) (x int)

type Vertex

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