/Rust

All Algorithms implemented in Rust

Primary LanguageRustMIT LicenseMIT

The Algorithms - Rust Gitter Build Status

All algorithms implemented in Rust (for educational purposes)

These are for demonstration purposes only.

Graphs

  • Dijkstra (Not implemented yet)
  • Kruskal's Minimum Spanning Tree (Not implemented yet)
  • Prim's Minimum Spanning Tree (Not implemented yet)
  • BFS (Not implemented yet)
  • DFS (Not implemented yet)
  • 0-1 Knapsack (Not implemented yet)
  • Edit Distance
  • Longest common subsequence (Not implemented yet)
  • Longest increasing subsequence (Not implemented yet)
  • K-Means Clustering
  • Coin Change (Not implemented yet)
  • Rod cut (Not implemented yet)
  • Egg Dropping Puzzle

Data Structures

  • Queue (Not implemented yet)
  • Heap
  • Linked List
  • Graph (Not implemented yet)
    • Directed (Not implemented yet)
    • Undirected (Not implemented yet)
  • Trie (Not implemented yet)
  • Binary Tree (Not implemented yet)
  • B-Tree
  • AVL Tree (Not implemented yet)

Strings

General

  • Convex Hull: Graham Scan
  • N-Queensp (Not implemented yet)
  • Graph Coloringp (Not implemented yet)
  • Tower of Hanoip (Not implemented yet)

Contributing

See CONTRIBUTING.md