Package goraph implements graph data structure and algorithms.

goraph Package goraph implements graph data structure and algorithms. go get -v; I have tutorials and visualizations of graph, tree algorithms: Binary search tree Go: heap, priority queue Go
Category: Golang / Science and Data Analysis
Watchers: 38
Star: 706
Fork: 80
Last update: Jan 26, 2023

Related Repos

notebaseapp kgraph whitepaper kgraph - a decentralised knowledge graph network Motivation Its fascinating to imagine a world where you personal notes live on a de

goplus GoPlus - The Go+ language for data science

hto This tool allows you to do a small analysis of the amount of keys and memory you use in Redis. It allows you to see overlooked keys and notice overuse.

thealamu Stream data processing micro-framework; Read, clean, process and store data using pre-defined and custom pipelines.

arr-ai The ultimate data engine.

goplus GoPlus - Script-like style, and more readable code for data science than Go.

robaho Summary A fixed place numeric library designed for performance. All numbers have a fixed 7 decimal places, and the maximum permitted value is +- 99999999999, or just under 100 billion. The library is safe for concurrent use. It has built

gonum Gonum Installation The core packages of the Gonum suite are written in pure Go with some assembly. Installation is done using go get. go get -u Supported Go versions Gonum su

cpmech Gosl – Go scientific library Gosl is a Go library to develop Artificial Intelligence and High-Performance Scientific Computations. NOTICE 2020-02-14 Thank you, Contributors!!! 😃 The library tries to be as ge

gonum Gonum floats This repository is no longer maintained. Development has moved to package floats provides a set of helper routines for dealing with slices of float64. The functions avoid

gopherdata Go data resources Please see the following sub-sections for specific types of Go-based data science resources: Community Resources → (events, conferences, blogs, etc...) Tooling Resources → (packages, libr

prettymuchbryce kademlia This is a Go implementation of a vanilla Kademlia DHT. The implementation is based off of a combination of the original Kademlia whitepaper and the xlattice design specification. It does not attempt to conform to BE

ziutek Go implementation of BLAS (Basic Linear Algebra Subprograms) Any function is implemented in generic Go and if it is justified, it is optimized for AMD64 (using SSE2 instructions). AMD64 implementation uses MOVUPS/MOVUPD instruct

vdobler Charts for Go Basic charts in go. This package focuses more on autoscaling, error bars, and logarithmic plots than on beautifull or marketing ready charts. Examples Chart Types The following chart types

soniah evaler Package evaler implements a simple floating point arithmetic expression evaluator. Evaler uses Dijkstra's Shunting Yard algorithm to convert an infix expression to postfix/RPN format,