/wanderer

Random walk propability estimations with linear equation solving.

Primary LanguageRustMIT LicenseMIT

Wanderer

Wanderer problem, also known as Random Walk or Drunkard's Walk, is a random process that describes a path that consists of a succession of random steps on some mathematical space. -- Wikipedia

This repo is one of the projects for the Numerical Algorithms course I'm taking at my University. Besides solving the wanderer problem it also implements the following algorithms for solving systems of linear equations:

Algorithm \ Representation 2D Vector HashMap Sparse
Jacobi ✅ ✅
Gauss-Seidel ✅ ✅
Gauss Elimination (without pivoting) ✅ ✅
Gauss Elimination (partial pivot) ✅ ✅

Requirements

Quick Setup

Download this repository using:

$ git clone https://github.com/wedkarz02/wanderer.git

or use the Download ZIP option from the GitHub repository page.

To compile the project, use cargo build. I highly recommend compiling in --release mode due to better execution speed.

$ cargo build --release

Run the executable directly or with cargo run --release. See src/main.rs for avaliable command line arguments.

License

If not directly stated otherwise, everything in this project is under the MIT License. See the LICENSE file for more info.

Cool links and references