The Wayback Machine - https://web.archive.org/web/20201031073958/https://github.com/SelfCodeLearning/Rust
Skip to content
master
Go to file
Code
This branch is 9 commits behind TheAlgorithms:master.

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
src
 
 
 
 
 
 
 
 
 
 
 
 

README.md

The Algorithms - Rust Gitter Build Status

All algorithms implemented in Rust (for educational purposes)

These are for demonstration purposes only.

Sort Algorithms

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)

Dynamic Programming

  • 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)

Search Algorithms

Ciphers


Contributing

See CONTRIBUTING.md

About

All Algorithms implemented in Rust

Resources

License

Releases

No releases published

Packages

No packages published

Languages

You can’t perform that action at this time.