Skip to content

aggelgian/erlang-algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

8ceee72 · Apr 24, 2018

History

65 Commits
Mar 19, 2016
Jul 15, 2014
Feb 7, 2013
Apr 24, 2018
Apr 24, 2018
Apr 23, 2018
Apr 24, 2018
Apr 24, 2018
Apr 24, 2018
Feb 7, 2013
Apr 23, 2018
Apr 23, 2018
Jul 15, 2014

Repository files navigation

erlang-algorithms

About the project

The goal of this project is to implement some useful algorithms and data structures in Erlang so as to help anyone who may need them.

  • Currently Implemented Data Structures:

    • Directed, Undirected, Weighted, Unweighted Graphs
    • Min / Max Heaps
    • Union / Find
  • Currently Implemented Algorithms:

    • BFS
    • DFS
    • Dijkstra
    • Kruskal
    • Edmonds-Karp
    • Ford-Fulkerson
    • A*

How to Compile and Run

  • Compile the source code and the demo : make
  • Run dialyzer : make dialyzer
  • All of the above : make all
  • Run the demo : make demo
  • Make edoc : make edoc

The files in the demo folder contain functions that demostrate the code in action.

For full documentation check the site

License

This project is released under the Apache License 2.0.