Documentation
¶
Overview ¶
Package structure is a subpackage that is dedicated to different implementations of data structures in the domain of computer science.
Source Files
Directories
¶
| Path | Synopsis |
|---|---|
|
Package queue provides an implementation of a circular queue data structure.
|
Package queue provides an implementation of a circular queue data structure. |
|
Package deque implements a Double Ended Queue data structure.
|
Package deque implements a Double Ended Queue data structure. |
|
Package dynamicarray A dynamic array is quite similar to a regular array, but its Size is modifiable during program runtime, very similar to how a slice in Go works.
|
Package dynamicarray A dynamic array is quite similar to a regular array, but its Size is modifiable during program runtime, very similar to how a slice in Go works. |
|
Fenwick Tree Data Structure for efficient range queries on an array of integers.
|
Fenwick Tree Data Structure for efficient range queries on an array of integers. |
|
Package linkedlist demonstrates different implementations on linkedlists.
|
Package linkedlist demonstrates different implementations on linkedlists. |
|
package set implements a Set using a golang map.
|
package set implements a Set using a golang map. |
|
Package trie provides Trie data structures in golang.
|
Package trie provides Trie data structures in golang. |
Click to show internal directories.
Click to hide internal directories.