Skip to content

Base traits for distance-based clustering algorithms

License

Notifications You must be signed in to change notification settings

savish/clusters

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Clusters

Build Status

Useful traits for clustering algorithms.

This library can be used as a basis for implementing a wide variety of 'distance' based clustering algorithms, such as DBSCAN.

Usage

The library is written entirely in Rust. To use it in your project, add the latest stable version of this crate to your Cargo.toml dependencies.

Cargo.toml

[dependencies]
clusters = "0.1"

In your project, import the library using the following code:

extern crate clusters;
use clusters::{Algorithm, Proximity}

Note that the above code makes the Algorithm and Proximity traits available for usage in the given scope, without needing the clusters:: qualification. For instance:

struct DBSCAN { ... }

impl Algorithm for DBSCAN {...}

Examples

TODO

Tests

TODO

Versioning

This project uses SemVer for versioning. For the versions available, see the releases tagged on this repository.

Authors

Primary: Alan K mailto:afksavish@gmail.com @savish

License

This project is licensed under the MIT License - see the LICENSE.md file for details

Contributing

Please see CONTRIBUTING.md for the process of contributing to this repo.