pkg/dijkstra.go


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

package algos

const Infinity uint32 = 1<<32 - 1

type Noder interface {
	Neighbors(n Node) []Node
	UpdateOrEnd(n Node) bool
}

type Node interface {
	Index() int
}

type HeapItem struct {
	Node
	index int
}

func dijkstra(searchSpace []Node, start Node, noder Noder) {
}