dijkstrapq

package

v0.0.0-...-23e9799 Latest Latest Go to latest Published: Jul 15, 2021 License: MIT Imports: 1 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

View Source

const (
	WHITE = 0
	GRAY  = 1
	BLACK = 2
)

This section is empty.

This section is empty.

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

func NewDijkstraSolver(vinf Value, less Less, estimate Estimate) *DijkstraSolver

func (ds *DijkstraSolver) Dijkstra(S []StartPoint, n int, AG [][]Edge) []Value

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

edge of graph

type Estimate func(cid int, cv Value, e Edge) Value

Estimate returns next value considered by transition.

type Less func(l, r Value) bool

Less returns l < r, and shared with pq.

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

for initializing start points of dijkstra algorithm

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

DP value type

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

Definitions of a priority queue

type VertexPQ []*Vertex

func NewVertexPQ() *VertexPQ

func (pq VertexPQ) Len() int

func (pq VertexPQ) Less(i, j int) bool

func (pq *VertexPQ) Pop() interface{}

func (pq *VertexPQ) Push(x interface{})

func (pq VertexPQ) Swap(i, j int)

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

weight of edge