# README
Note
This is a minimal fork of cpmech/gosl. I have copied only one file of the graph subpackage to get rid of the annoying cgo dependencies that it's carrying with it. The contents are modified minimally in order to cut down the dependencies to zero.
Run import.sh to update the package from time to time.
# Functions
Alloc allocates a slice of slices of float64.
Imax returns the maximum between two integers.
IntAlloc allocates a matrix of integers.
IntAssertLessThan panics if a >= b.
Min returns the minimum between two float point numbers.
Panic just panics.
Sf wraps Sprintf.
# Structs
Munkres (Hungarian algorithm) method to solve the assignment problem
based on code by Bob Pilgrim from http://csclab.murraystate.edu/bob.pilgrim/445/munkres.html Note: this method runs in O(n³), in the worst case; therefore is not efficient for large matrix Example: $ | Clean Sweep Wash -------|-------------------- Fry | [2] 3 3 Leela | 3 [2] 3 Bender | 3 3 [2] minimum cost = 6
Note: cost will be minimised.
# Type aliases
MaskType defines the type of mask.