hub / github.com/arnauddri/algorithms
github.com/arnauddri/algorithms @main sqlite
319 symbols
923 edges
75 files
7 documented · 2%
README
Algorithms 
Classic algorithms and data structures implemented in Go. Not for production use, it is mostly an attempt to get comfortable both with Go and key CS concepts.
Contents
Data Structures
- Binary Search Tree (wiki)
- Graph (wiki)
- Hash Tables (wiki)
- Linked List (wiki)
- Matrix (wiki)
- Min/Max Heap (wiki)
- Priority Queue (wiki)
- Queue (wiki)
- Stack (wiki)
Graph algorithms
Searching: * Depth First Search (wiki) * Breadth First Search (wiki) * Kosaraju's Algorithm (find all SCCs) (wiki)
Shortest path: * Breadth First Search Shortest Path (wiki) * Dijkstra (wiki)
Sorting: * Topological Sort (wiki)
Maths algorithms
- Binary GCD algorithm (wiki)
- Closest pairs (wiki)
- FastPower (wiki)
- Fibonacci (wiki)
- Fisher-Yates Shuffle (wiki)
- Erastothenes Sieve (wiki)
- Extented GCD algorithm (wiki)
- Karatsuba's Multiplication (wiki)
- Newton's Square Root (wiki)
- Permutations Count
- Strassen's matrix multiplication (wiki)
- Randomized Selection
Sorting algorithms
- Bubble Sort (wiki)
- Heap Sort (wiki)
- Quick Sort (wiki)
- Merge Sort (wiki)
- Insertion Sort (wiki)
- Shell Sort (wiki)
- Selection Sort (wiki)
Searching algorithms
Extension points exported contracts — how you extend this code
Item (Interface)(no doc) [2 implementers]
data-structures/heap/heap.go
VerticesIterable (Interface)
(no doc) [2 implementers]
data-structures/graph/graph.go
Point (Interface)
(no doc) [2 implementers]
algorithms/maths/closest-pair/closest_pair.go
EdgesIterable (Interface)
(no doc) [1 implementers]
data-structures/graph/graph.go
Pair (Interface)
(no doc)
algorithms/maths/closest-pair/closest_pair.go
Core symbols most depended-on inside this repo
GetElmcalled by 33
data-structures/matrix/matrix.go
Insert
called by 32
data-structures/priority-queue/priority_queue.go
NewItem
called by 30
data-structures/priority-queue/priority_queue.go
AddEdge
called by 25
data-structures/graph/graph.go
NewNode
called by 22
data-structures/linked-list/linked_list.go
Insert
called by 22
data-structures/heap/heap.go
SetElm
called by 22
data-structures/matrix/matrix.go
AddVertex
called by 18
data-structures/graph/graph.go
Shape
Languages
Go100%
Modules by API surface
data-structures/graph/graph.go25 symbols
algorithms/maths/fibonacci/fibonacci_test.go20 symbols
data-structures/linked-list/linked_list.go16 symbols
data-structures/matrix/matrix.go15 symbols
algorithms/maths/closest-pair/closest_pair.go15 symbols
data-structures/heap/heap.go14 symbols
algorithms/maths/eratosthenes-sieve/primes_benchmark.go11 symbols
data-structures/priority-queue/priority_queue.go10 symbols
data-structures/hash-tables/ht.go10 symbols
data-structures/matrix/matrix_test.go9 symbols
data-structures/binary-tree/bst.go9 symbols
data-structures/stack/stack.go7 symbols
For agents
$ claude mcp add algorithms \
-- python -m otcore.mcp_server <graph>