solvr 0.2.0

Advanced computing library for real-world problem solving - optimization, differential equations, interpolation, statistics, and more
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

//! CPU implementation of graph matrix algorithms.

use crate::graph::impl_generic::{
    adjacency_matrix_impl, incidence_matrix_impl, laplacian_matrix_impl,
};
use crate::graph::traits::matrices::GraphMatrixAlgorithms;
use crate::graph::traits::types::GraphData;
use numr::error::Result;
use numr::runtime::cpu::{CpuClient, CpuRuntime};
use numr::sparse::SparseTensor;

impl GraphMatrixAlgorithms<CpuRuntime> for CpuClient {
    fn laplacian_matrix(
        &self,
        graph: &GraphData<CpuRuntime>,
        normalized: bool,
    ) -> Result<SparseTensor<CpuRuntime>> {
        laplacian_matrix_impl(self, graph, normalized)
    }

    fn adjacency_matrix(&self, graph: &GraphData<CpuRuntime>) -> Result<SparseTensor<CpuRuntime>> {
        adjacency_matrix_impl(self, graph)
    }

    fn incidence_matrix(&self, graph: &GraphData<CpuRuntime>) -> Result<SparseTensor<CpuRuntime>> {
        incidence_matrix_impl(self, graph)
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use numr::runtime::cpu::CpuDevice;

    #[test]
    fn test_laplacian() {
        let device = CpuDevice::new();
        let client = CpuClient::new(device.clone());

        let graph =
            GraphData::from_edge_list::<f64>(&[0, 1], &[1, 2], None, 3, false, &device).unwrap();

        let lap = client.laplacian_matrix(&graph, false).unwrap();
        assert_eq!(lap.shape(), [3, 3]);
    }

    #[test]
    fn test_adjacency_matrix() {
        let device = CpuDevice::new();
        let client = CpuClient::new(device.clone());

        let graph =
            GraphData::from_edge_list::<f64>(&[0, 1], &[1, 2], None, 3, true, &device).unwrap();

        let adj = client.adjacency_matrix(&graph).unwrap();
        assert_eq!(adj.shape(), [3, 3]);
        assert_eq!(adj.nnz(), 2);
    }
}