Go Data structures and algorithms

This repository contains implementations of various data structures and algorithms using GoLang. The goal is to implement as many as possible while learning and mastering GoLang.

Each implementation is accompanied by unit tests to ensure correctness.

To run the tests, you can use the following command.

go run RunTests.go

To run tests in a single directory, use the command.

# To run tests on the arrays directory
go run RunTests.go ./structures/arrays

Data Structures

• Arrays (One-dimensional)
• Arrays (Two-dimensional)
• Singly Linked List
• Doubly Linked List
• Stack
• Simple Queue
• Priority Queue
• Heap Priority Queue
• Hash Table
• Binary Search Tree
• Heap

Graph representation

• Adjacency Matrix
• Adjacency List

Algorithms

Sorting

• Bubble sort
• Selection sort
• Insertion sort
• Merge sort
• Quick sort
• Heap sort

Searching

• Linear Search
• Binary Search

Graphing

Basic traversal

• Breadth-First Search
• Depth-First Search

Pathfinding

• Dijkstra

• TODO: Implement Heap Priority Queue to Dijkstra
  

• Bellman-Ford
• Floyd-Warshall
• A* (A-Star)