fp-growth 0.1.6

An implementation of the FP-Growth algorithm in pure Rust
Documentation
# fp-growth-rs

[![Crates.io](https://img.shields.io/crates/v/fp-growth)](https://crates.io/crates/fp-growth)
[![docs.rs](https://img.shields.io/docsrs/fp-growth)](https://docs.rs/fp-growth)

An implementation of the FP-Growth algorithm in pure Rust, which is inspired by [enaeseth/python-fp-growth](https://github.com/enaeseth/python-fp-growth).

## Usage

Add this to your `Cargo.toml`:

```toml
[dependencies]
fp-growth = "0.1"
```

## Example

```rust
use fp_growth::algorithm::FPGrowth;

fn main() {
    let transactions = vec![
        vec!["e", "c", "a", "b", "f", "h"],
        vec!["a", "c", "g"],
        vec!["e"],
        vec!["e", "c", "a", "g", "d"],
        vec!["a", "c", "e", "g"],
        vec!["e"],
        vec!["a", "c", "e", "b", "f"],
        vec!["a", "c", "d"],
        vec!["g", "c", "e", "a"],
        vec!["a", "c", "e", "g"],
        vec!["i"],
    ];
    let minimum_support = 2;
    let fp_growth_str = FPGrowth::<&str>::new(transactions, minimum_support);

    let result = fp_growth_str.find_frequent_patterns();
    println!("The number of results: {}", result.frequent_patterns_num());
    for (frequent_pattern, support) in result.frequent_patterns().iter() {
        println!("{:?} {}", frequent_pattern, support);
    }
}
```

## License

`fp-growth-rs` is distributed under the terms of the MIT license.

See [LICENSE](LICENSE) for details.