PH-tree (Permutation Hierarchical Tree) implementation in Go.
-
Updated
Apr 5, 2024 - Go
PH-tree (Permutation Hierarchical Tree) implementation in Go.
Sparse-Matrix Linked-List Go is a sparse matrix implementation in Go using a linked list. This is a data structure that stores only non-zero values in a matrix. This is useful when you have a lot of zeros in your matrix. This data structure is also useful when you want to perform operations on sparse matrices.
A Go package for working with sparse polynomials. (Based on Array List data structure)
Add a description, image, and links to the sparse topic page so that developers can more easily learn about it.
To associate your repository with the sparse topic, visit your repo's landing page and select "manage topics."