Simple and high-performance data structures and algorithms library

Implements some containers (stack, queue, priorityQueue, set, arrayList, linkedList, map and btree) in golang

golang实现常用集合

快写完了....支持泛型的数据结构库(vec, linkedlist, skiplist, hashtable, btree, avltree, rbtree, trie, set

Generic Golang implementation of a few basic data structures.

Data-Structure implementation in Go

this repository implements all collections like sorted list, array List, single linked list, stack, queue

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.

Here is a box of chocolates, here is the magic room, come in and have a look for a surprise!

This is a simple implementation of a queue using a linked-list in Go. This is a good example of how to use a linked-list in Go.

Provide generic wrappers for some basic types of golang, and extend some common types and type tools

High performance and easy to use datastructure packages for Golang

Simple LinkedList in Go

Go Collections data structure package

Generic data structures of Golang

This is a Go program for creating a complete tree using linked list. You can easily insert nodes to the tree and print it. This library provide two inserting functions. One of them is for inserting nodes to the tree by filling the tree from left to right in per row. and the next one is to insert to left side of the tree.

Singly Linked List in go

I created my own linked list using Go. Even though Go had their own library for linked list named 'list'

A generic implementation of the doubly linked list data type in golang.