Exads

Algorithms and Data Structures Collection in Elixir

This is a library with a collection of some of the most used and well known algorithms and data structures.

Find the algorithms inside Exads.Algos and data structures inside Exads.DataStructures

Installation

1. Add exads to your list of dependencies in mix.exs:

   def deps do [{:exads, "~> 0.0.1"}] end

2. Ensure exads is started before your application:

   def application do [applications: [:exads]] end

TODO

Data Structures

• Stack
• Queue
• Priority Queue
• Double-ended Queue
• Binary Search Tree (implemented with Map)
• Binary Search Tree (implemented with Tuple)
• Tree
• Binary Tree
• Red Black Tree
• Directed Graph
• Undirected Graph
• Bitmap
• Lookup Table

Algorithms

• Binary Search
• Breadth-First Search for Binary Search Tree
• Depth-First Search for Binary Search Tree
• Breadth-First Search for Graphs
• Depth-First Search for Graphs
• Brute-Force Search