dijkstra

Documentation

Index

• func Dijkstra(graph Graph, start int, n int) []int
• type Edge
• type Graph
• type Item
• type PriorityQueue
  • func (pq PriorityQueue) Len() int
  • func (pq PriorityQueue) Less(i, j int) bool
  • func (pq *PriorityQueue) Pop() any
  • func (pq *PriorityQueue) Push(x any)
  • func (pq PriorityQueue) Swap(i, j int)

Functions

func Dijkstra

func Dijkstra(graph Graph, start int, n int) []int

Types

type Edge

type Edge struct {
	To     int
	Weight int
}

type Graph

type Graph map[int][]Edge

type Item

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

type PriorityQueue

type PriorityQueue []*Item

func (PriorityQueue) Len

func (pq PriorityQueue) Len() int

func (PriorityQueue) Less

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

func (*PriorityQueue) Pop

func (pq *PriorityQueue) Pop() any

func (*PriorityQueue) Push

func (pq *PriorityQueue) Push(x any)

func (PriorityQueue) Swap

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