pathfinding 0.4.2

Pathfinding, flow, and graph algorithms
Documentation
#![cfg(test)]

extern crate pathfinding;

use pathfinding::SquareMatrix;

#[test]
fn test_sm() {
    let mut m = SquareMatrix::new(2, 0usize);
    m[&(0, 0)] = 0;
    m[&(0, 1)] = 1;
    m[&(1, 0)] = 10;
    m[&(1, 1)] = 11;
    m[&(0, 1)] = 2;
    assert_eq!(m[&(0, 0)], 0);
    assert_eq!(m[&(0, 1)], 2);
    assert_eq!(m[&(1, 0)], 10);
    assert_eq!(m[&(1, 1)], 11);
    m.fill(33);
    assert_eq!(m[&(0, 0)], 33);
    assert_eq!(m[&(0, 1)], 33);
    assert_eq!(m[&(1, 0)], 33);
    assert_eq!(m[&(1, 1)], 33);
}

#[test]
fn test_from_vec() {
    let m = SquareMatrix::from_vec(vec![10, 20, 30, 40]);
    assert_eq!(m.size, 2);
    assert_eq!(m[&(0, 0)], 10);
    assert_eq!(m[&(0, 1)], 20);
    assert_eq!(m[&(1, 0)], 30);
    assert_eq!(m[&(1, 1)], 40);
}