ExCollections
Collection of several data structures and their implementation in Elixir, each containing benchmarks regarding their performance.
Installation
If available in Hex, the package can be installed as:
Add excollections to your list of dependencies in
mix.exs:def deps do
[{:excollections, "~> 0.0.1"}]end
Ensure excollections is started before your application:
def application do
[applications: [:excollections]]end
Data structures
- Stack
- Queue
- Binary Search Tree
- Graph (Adjacency Lists)
- Set
- Priority Queue
- Red-black Tree
- AVL Tree
- Bitset
- --Circular Queue-- irrelevant since it is only useful when data is mutable - which is not Elixir/Erlang VM's case.
Algorithms
- DFS
- BFS
- Binary Search
- Dijkstra
- Floyd-Warshall
- A*
- MST (Minimum Spanning Tree)