Scalgorithms is a collection of basic algorithms and datastructures written in Scala.

Following is the list of algorithms supported so far :

- Sorting : QuickSort, MergeSort

- Heaps : Binomial Heaps,Fibonacci Heaps

- Dynamic Programming : Longest Common Subsequence

- Graphs :

Search Algorithms :

Depth First (including routines for Topological Sorting and Strongly Connected Components),Breadth First, A-Star

Minimum Spanning Tree Algorithms : Prim's Algorithm,Kruskal's Algorithm

Shortest Path Algorithms :

Single Source :Dijkstra's Algorithm, Bellman-Ford Algorithm, DAG-Shortest Path Algorithm

All Pairs : Dynamic Programming based Algorithm (improved with Matrix Multiplication strategy), Floyd-Warshall Algorithm, Johnson's Algorithm

Transitive Closure Algorithms :DFS based Algorithm,Floyd-Warshall Algorithm

Algorithms from - Artificial Intelligence : A Modern Approach

- A-Star Search

- Constraint Satisfaction

- Backtracking Search

- Backtracking Search with Heuristics : Minimum Remaining Values(MRV) & Degree Heuristic, Least Constraining Value Heuristic, Forward Checking, Constraint Propagation - AC3 (for binary CSPs)

- Game

- MiniMax

- Alpha-Beta Prunning