algorithms

Documentation

Index

• func Dijkstra[T comparable, O constraints.Ordered](al structures.AdjacencyList[T, O], origin T) map[T]O
• func FindIndexInSorted[T constraints.Ordered](slc []T, val T) int

Functions

func Dijkstra

func Dijkstra[T comparable, O constraints.Ordered](al structures.AdjacencyList[T, O], origin T) map[T]O

func FindIndexInSorted

func FindIndexInSorted[T constraints.Ordered](slc []T, val T) int

FindIndexInSorted will find the index in a sorted slice that you would insert a value into. The value at that index will be greater than or equal to the value you are searching for. If the index is equal to the length of the slice, then all value in the slice are less than the value you are searching for.