Color provides a type for vertex color

AVL represents a AVL tree. By default, _NIL = nil.

AVLNode represents a single node in the AVL.

BSNode represents a single node in the BinarySearch.

BinarySearch represents a Binary-Search tree. By default, _NIL = nil.

CRCModel contains the necessary parameters for calculating the DRC algorithm

CircularQueue represents a circular queue data structure.

Combinations structure with in and out rune

Conf stands for configurations set provided to GeneticString function.

Cyclic Struct which cycles the linked list in this implementation.

Doubly structure with just the Head Node We call it `Doubly` to make it easier to understand when calling this in peoples own local code to understand

DynamicArray structure

EuclideanPoint defines a point with x and y coordinates.

FenwickTree represents the data structure of the Fenwick Tree

Float is a generic type constraint for all floating point types.

Graph provides a structure to store the graph. It is safe to use its empty object.

Graph provides a structure to store an undirected graph. It is safe to use its empty object.

HashMap is a Golang implementation of a hashmap

Heap heap implementation using generic.

Integer is a generic type constraint for all integers (signed and unsigned.)

LFU the Least Frequently Used (LFU) page-replacement algorithm

LQueue will be store the value into the list

Node structure

Node will be store the value and the next node as well

Node Structure representing the linkedlist node. This node is shared across different implementations.

Node represents each node in Trie.

A Node of an Huffman tree, which can either be a leaf or an internal node. Each node has a weight. A leaf node has an associated symbol, but no childr

Number is a generic type constraint for all numeric types in Go except Complex types.

Ordered is a generic type constraint for all ordered data types in Go. Loosely speaking, in mathematics a field is an ordered field if there is a "tot

Point defines a point with x and y coordinates.

Polybius is struct having size, characters, and key

Population item represent a single step in the evolution process. One can think of population item as a single species. Key stands for the actual data

Queue structure is tell us what our head is and what tail should be with length of the list

RB represents a Red-Black tree. By default, _NIL = leaf, a dummy variable.

RBNode represents a single node in the RB.

Result structure contains generation process statistics, as well as the best resulted population item.

Result structure to hold occurrences

SList is our struct that point to stack with container/list.List library

SegmentTree represents the data structure of a segment tree with lazy propagation

Set is an interface of possible methods on 'set'.

Signed is a generic type constraint for all signed integers.

Singly structure with length of the list and its head

Sqrt (or Square Root) Decomposition is a technique used for query an array and perform updates Inside this package is described its most simple data s

Stack has jost top of node and with length

A SymbolFreq is a pair of a symbol and its associated frequency.

Defining the union-find data structure

Unsigned is a generic type constraint for all unsigned integers.

Vector defines a tuple with 3 values in 3d-space

WeightedGraph defining matrix to use 2d array easier

apHelper stores auxiliary data used to identify articulation points in a graph.

dsa represents the DSA

numeral describes the value and symbol of a single roman numeral

parameters represents the DSA parameters

Query interval

Query interval

rsa struct contains the public key, private key and modulus