day15

Documentation

Index

• func A(input *advent.Input) (int, error)
• func B(input *advent.Input) (int, error)
• type DirectedGraph
  • func NewBigCaveGraph(input *advent.Input, multiplier int) *DirectedGraph
  • func NewCaveGraph(input *advent.Input) *DirectedGraph
  • func (g *DirectedGraph) ShortestPath(src, dest string) int
• type Edge
• type UnvisitedNode
• type UnvisitedNodeQueue
  • func (q UnvisitedNodeQueue) Len() int
  • func (q UnvisitedNodeQueue) Less(i, j int) bool
  • func (q *UnvisitedNodeQueue) Pop() interface{}
  • func (q *UnvisitedNodeQueue) Push(x interface{})
  • func (q UnvisitedNodeQueue) Swap(i, j int)

Functions

func A

func A(input *advent.Input) (int, error)

func B

func B(input *advent.Input) (int, error)

Types

type DirectedGraph

type DirectedGraph map[string][]Edge

func NewBigCaveGraph

func NewBigCaveGraph(input *advent.Input, multiplier int) *DirectedGraph

func NewCaveGraph

func NewCaveGraph(input *advent.Input) *DirectedGraph

func (*DirectedGraph) ShortestPath

func (g *DirectedGraph) ShortestPath(src, dest string) int

type Edge

type Edge struct {
	To     string
	Weight int
}

type UnvisitedNode

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

type UnvisitedNodeQueue

type UnvisitedNodeQueue []*UnvisitedNode

func (UnvisitedNodeQueue) Len

func (q UnvisitedNodeQueue) Len() int

func (UnvisitedNodeQueue) Less

func (q UnvisitedNodeQueue) Less(i, j int) bool

func (*UnvisitedNodeQueue) Pop

func (q *UnvisitedNodeQueue) Pop() interface{}

func (*UnvisitedNodeQueue) Push

func (q *UnvisitedNodeQueue) Push(x interface{})

func (UnvisitedNodeQueue) Swap

func (q UnvisitedNodeQueue) Swap(i, j int)