c语言实现稀疏矩阵转置的代码

稀疏矩阵转置是指将一个稀疏矩阵按照行列互换的方式变换成另一个稀疏矩阵。下面是一个使用 C 语言实现稀疏矩阵转置的代码示例：

#include <stdio.h>

#define MAX_TERMS 101
#define MAX_COL 101

typedef struct {
    int row;
    int col;
    int value;
} term;

void fast_transpose(term a[], term b[]);

int main() {
    term a[MAX_TERMS], b[MAX_TERMS];
    int m, n, num_terms;
    printf("Enter the number of rows and columns in the matrix: ");
    scanf("%d %d", &m, &n);
    printf("Enter the number of non-zero elements in the matrix: ");
    scanf("%d", &num_terms);
    printf("Enter the non-zero elements of the matrix:\n");
    for (int i = 0; i < num_terms; i++) {
        scanf("%d %d %d", &a[i].row, &a[i].col, &a[i].value);
    }
    fast_transpose(a, b);
    printf("The original matrix is:\n");
    for (int i = 0; i < num_terms; i++) {
        printf("%d %d %d\n", a[i].row, a[i].col, a[i].value);
    }
    printf("The transpose matrix is:\n");
    for (int i = 0; i < num_terms; i++) {
        printf("%d %d %d\n", b[i].row, b[i].col, b[i].value);
    }
    return 0;
}

void fast_transpose(term a[], term b[]) {
    int row_terms[MAX_COL];
    int starting_pos[MAX_COL];
    int num_cols = a[0].col;
    int num_terms = a[0].value;
    b[0].row = num_cols;
    b[0].col = a[0].row;
    b[0].value = num_terms;
    if (num_terms > 0) {
        for (int i = 0; i < num_cols; i++) {
            row_terms[i] = 0;
        }
        for (int i = 1; i <= num_terms; i++) {
            row_terms[a[i].col]++;
        }
        starting_pos[0] = 1;
        for (int i = 1; i < num_cols; i++) {
            starting_pos[i] = starting_pos[i-1] + row_terms[i-1];
        }
        for (int i = 1; i <= num_terms; i++) {
            int j = starting_pos[a[i].col]++;
            b[j].row = a[i].col;
            b[j].col = a[i].row;
            b[j].value = a[i].value;
        }
    }
}

该程序通过定义 `term` 结构体来存储稀疏矩阵的非零元素，使用 `fast_transpose` 函数来实现稀疏矩阵转置，通过读取用户输入的行数、列数和非零元素的数量，将原始稀疏矩阵存储在 `a` 数组中，并将转置后的稀疏矩阵存储在 `b` 数组中，最后输出原始矩阵和转置后的矩阵。