Need help with Algorithms?

Click the “chat” button below for chat support from the developer who created it, or find similar developers for support.

167 Stars 11 Forks MIT License 143 Commits 0 Opened issues

Algorithms implemented in Rust, explained.

Readme

This repository presents Rust implementations of common algorithms and data structures, many of which are based on William Fiset's Java implementation: https://github.com/williamfiset/Algorithms . I highly recommend his YouTube channel, where he explains many of these algorithms in detail using illustrations, animations and pseudocode. I recommend that you implement these algorithms by yourself before comparing them to my or William's implementations, since the best way to learn is by doing, and it's likely that you discover ways in which the code can be written in a more efficient, robust and/or readable way, in which case you're welcome to submit a PR!

I also write algorithms that's not yet available in William's repository. When I do so I attach references (most of which are freely accessible) that I used and hopefully they should be sufficient to guide you to write your own implementations.

The implementation details are explained in comments and docs and the example usage is implied in unit tests. To run tests:

cargo test

I use LaTeX to write some math expression in docs. To render them correctly in docs, run:

RUSTDOCFLAGS="--html-in-header katex-header.html" cargo doc --no-deps --open

or an alias for this command:

./doc

- Editor: Visual Studio Code
- Extension: rust-analyzer

This simple setup provides most features a decent IDE would provide (importantly, jump to definition and type labelling)

- Adjacency Matrix (Weighted & Unweighted)
- Adjacency List (Weighted & Unweighted)
- Condensed Adjacency Matrix (Weighted)

- Depth-first search (iterative and recursive)
- Breadth-first search (iterative)

- Tree representation: with or without pointer to parent
- Fundamentals (DFS, tree height, tree sum, etc.)
- Tree Center
- Tree rooting
- Tree isomorphism
- Lowest common ancestor (LCA)

- Prim's Algorithm
- Kruskal's Algorithm

- Ford-Fulkerson + DFS
- DFS with capacity scaling
- Edmonds-Karp Algorithm (BFS)
- Dinic's Algorithm (BFS + DFS)

- BFS (unweighted)
- DAG shortest path with topological sorting
- Dijkstra's algorithm (non-negative weights, SSSP)
- Bellman-Ford algorithm (SSSP)
- Floyd-Warshall algorithm (APSP)

- Bipartite check
- Topological sorting of DAG graphs and DAG shortest path
- Eulerian path/circuit
- Strongly connected components (Tarjan's algorithm)

- Bit manipulation
- Priority queue (binary heap)
- Balanced tree
- AVL tree

- Disjoin set (union-find)
- Sparse table (range query) (generic)
- Quadtree
- k-dimensional tree (k-d tree)

- Hierarchical clustering (WIP, almost done)

- in quad tree (docs/annotations WIP)
- in k-d tree (docs/annotations WIP)

- GCD/LCM
- log2

- Basics (matrix representation, matrix/vector arithmetics)
- Determinant of square matrix (Laplace expansion)
- Gauss-Jordan Elimination
- LU Decomposition
- Cholesky Decomposition

- Edit distance
- Knapsack 0/1

- Sudoku
- N-Queens

- Travelling salesman problem (brutal force & DP)

- Mice and owls