algorithms

package

v0.0.0-...-dbc70a4 Latest Latest Go to latest Published: Aug 28, 2025 License: MIT Imports: 4 Imported by: 0

Details

This section is empty.

This section is empty.

func Dijkstra[T comparable](g Graph[T], a, b T) int

Dijkstra is an implementation of Dijkstra's algorithm for finding the shortest path between two nodes in a graph. https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

func Shoelace[N math.Number](coords [][2]N) N

type Edge[T any] struct {
	A, B     T
	Distance int
}

func Karger[T comparable](g Graph[T]) ([]Edge[T], [2][]T)

type Graph[T comparable] struct {
	Nodes []T
	Edges []Edge[T]
}