algorithm_rust 0.6.0

some common rust_algorithms, Everyone can participate, and the project will continue to be updated, all the algorithms comes from <Introduction to Algorithms III>
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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127

use std::ops::{Add, Sub, Mul, Div};
use std::cmp::{PartialEq, Eq};

#[derive(Debug, PartialEq,Clone)]
///矩阵
///rows代表矩阵的行
///cols代表矩阵的列
///# Examples
///```
///    use algori::matrix::Matrix;
///    let matrix1 = Matrix::new(5, 10, vec![
///        vec![1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0],
///        vec![11.0, 12.0, 13.0, 14.0, 15.0, 16.0, 17.0, 18.0, 19.0, 20.0],
///        vec![21.0, 22.0, 23.0, 24.0, 25.0, 26.0, 27.0, 28.0, 29.0, 30.0],
///        vec![31.0, 32.0, 33.0, 34.0, 35.0, 36.0, 37.0, 38.0, 39.0, 40.0],
///        vec![41.0, 42.0, 43.0, 44.0, 45.0, 46.0, 47.0, 48.0, 49.0, 50.0],
///    ]);
///
///    let matrix2 = Matrix::new(10, 3, vec![
///        vec![1.0, 2.0, 3.0],
///        vec![4.0, 5.0, 6.0],
///        vec![7.0, 8.0, 9.0],
///        vec![10.0, 11.0, 12.0],
///        vec![13.0, 14.0, 15.0],
///        vec![16.0, 17.0, 18.0],
///        vec![19.0, 20.0, 21.0],
///        vec![22.0, 23.0, 24.0],
///        vec![25.0, 26.0, 27.0],
///       vec![28.0, 29.0, 30.0],
///    ]);
///
///    let product_matrix = matrix1 * matrix2;
///    
///```
///
///
///
pub struct Matrix {
    rows: usize,
    cols: usize,
    data: Vec<Vec<f64>>,
}

impl Matrix {
    pub fn new(rows: usize, cols: usize, data: Vec<Vec<f64>>) -> Self {
        Matrix { rows, cols, data }
    }
    ///检查矩阵是否正确,正确返回Some(1)
    pub fn check(&self) -> Option<usize> {
	if self.data.len() != self.rows {
            return None; // 行数不匹配
        }
        if self.data.iter().any(|row| row.len() != self.cols) {
            return None; // 列数不匹配
        }
	Some(1)
    }
}

impl Add for Matrix {
    type Output = Matrix;
    ///矩阵加法
    fn add(self, other: Matrix) -> Matrix {
        assert_eq!(self.rows, other.rows);
        assert_eq!(self.cols, other.cols);

        let data: Vec<Vec<f64>> = self.data
            .iter()
            .zip(other.data.iter())
            .map(|(row1, row2)| {
                row1.iter()
                    .zip(row2.iter())
                    .map(|(&a, &b)| a + b)
                    .collect()
            })
            .collect();

        Matrix::new(self.rows, self.cols, data)
    }
}

impl Sub for Matrix {
    type Output = Matrix;
    ///矩阵减法
    fn sub(self, other: Matrix) -> Matrix {
        assert_eq!(self.rows, other.rows);
        assert_eq!(self.cols, other.cols);

        let data: Vec<Vec<f64>> = self.data
            .iter()
            .zip(other.data.iter())
            .map(|(row1, row2)| {
                row1.iter()
                    .zip(row2.iter())
                    .map(|(&a, &b)| a - b)
                    .collect()
            })
            .collect();

        Matrix::new(self.rows, self.cols, data)
    }
}


impl Mul for Matrix {
    type Output = Matrix;
    ///矩阵乘法
    fn mul(self, other: Matrix) -> Matrix {
        assert_eq!(self.cols, other.rows);

        let mut result = vec![vec![0.0; other.cols]; self.rows];
        
        for i in 0..self.rows {
            for j in 0..other.cols {
                for k in 0..self.cols {
                    result[i][j] += self.data[i][k] * other.data[k][j];
                }
            }
        }

        Matrix::new(self.rows, other.cols, result)
    }
}