rustygraph 0.4.2

A high-performance library for visibility graph computation from time series data
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96

// Integration tests for natural visibility algorithm

use rustygraph::algorithms::{natural_visibility, visibility_weighted, VisibilityType};
use rustygraph::TimeSeries;

#[test]
fn test_simple_series() {
    let series = TimeSeries::from_raw(vec![1.0, 2.0, 1.0]).unwrap();
    let edges = natural_visibility(&series);
    // Expected: (0,1), (1,2), (0,2)
    assert!(edges.len() >= 2);
}

#[test]
fn test_weighted_edges() {
    let series = TimeSeries::from_raw(vec![1.0_f64, 3.0_f64, 2.0_f64]).unwrap();

    // Weight by value difference
    let edges = visibility_weighted(&series, VisibilityType::Natural, |_, _, vi, vj| {
        (vj - vi).abs()
    });
    
    assert!(edges.len() >= 2);
    // Check that weights are computed
    for ((i, j), weight) in edges {
        assert!(weight >= 0.0);
        println!("Edge ({}, {}) has weight {}", i, j, weight);
    }
}

#[test]
fn test_constant_weights() {
    let series = TimeSeries::from_raw(vec![1.0, 2.0, 3.0]).unwrap();

    // Constant weight function
    let edges = visibility_weighted(&series, VisibilityType::Natural, |_, _, _, _| 1.0);

    for ((_, _), weight) in edges {
        assert_eq!(weight, 1.0);
    }
}

#[test]
fn test_monotonic_increasing() {
    let series = TimeSeries::from_raw(vec![1.0, 2.0, 3.0, 4.0]).unwrap();
    let edges = natural_visibility(&series);
    // All points should see all other points
    println!("Monotonic increasing edges: {}", edges.len());
    for (i, j, _) in &edges {
        println!("  {} -> {}", i, j);
    }
    assert!(edges.len() >= 3);
}

#[test]
fn test_monotonic_decreasing() {
    let series = TimeSeries::from_raw(vec![4.0, 3.0, 2.0, 1.0]).unwrap();
    let edges = natural_visibility(&series);
    // All points should see all other points
    println!("Monotonic decreasing edges: {}", edges.len());
    for (i, j, _) in &edges {
        println!("  {} -> {}", i, j);
    }
    assert!(edges.len() >= 3);
}

#[test]
fn test_single_peak() {
    let series = TimeSeries::from_raw(vec![1.0, 3.0, 2.0]).unwrap();
    let edges = natural_visibility(&series);
    // All three points should be connected
    assert!(edges.len() >= 2);
}

#[test]
fn test_empty_series() {
    // Empty series returns error from from_raw
    let result = TimeSeries::<f64>::from_raw(vec![]);
    assert!(result.is_err());
}

#[test]
fn test_single_point() {
    let series = TimeSeries::from_raw(vec![1.0]).unwrap();
    let edges = natural_visibility(&series);
    assert_eq!(edges.len(), 0);
}

#[test]
fn test_two_points() {
    let series = TimeSeries::from_raw(vec![1.0, 2.0]).unwrap();
    let edges = natural_visibility(&series);
    // Should have one edge connecting them
    assert!(!edges.is_empty());
}