Minesweeper game developed with Rust, WebAssembly (Wasm), and Canvas

I suggest reworking the Vec that holds cells in the board from cells: Vec<Vec<Cell>> to cells: Vec<Cell> and implementing an index calculating method, something like:

fn get_index(&self, i: u32, j: u32) -> usize {
    (i * self.row + j) as usize
}

And from looking at the rest of the code, most of it would have to be modified to use this get_index method, when ever accessing or modifying cells. And creating the cells in the board should be just one long loop of for i in 0..(row * column)

I also recommend reworking the bomb_near_cell method, to remove unnecessary recursive function, to something like:

fn bomb_near_cell(&self, i: u32, j: u32) -> u8 {
    let mut count = 0;
    for delta_i in [self.heigh - 1, 0, 1].iter().cloned() {
        for delta_j in [self.width - 1, 0, 1].iter().cloned() {
            if (delta_i == 0 && delta_j == 0) || (delta_i < 0 || delta_j < 0 || delta_i > self.row || delta_j > self.column) {
                continue;
            }

            let neighbor_i = (i + delta_i) % self.row;
            let neighbor_j = (j + delta_j) % self.column;
            let idx = self.get_index(neighbor_i, neighbor_j);
            count += self.cells[idx].is_bomb as u8 // This will work because bool casting to int is false = 0, true = 1
        }
    }
    count
}

This way we have no need of recursive calling of the bomb_near_cell method when checking the cells around the current one. No need for the search_end parameter.

While JS is not my strong point, at quick glance, if correctly implemented these changes will not have any effect on the front end.