5:2压缩矩阵的转置

一、代码块

构造压缩矩阵

typedef struct Triple{
    
    //i代表矩阵行数，j代表矩阵列数，e代表储存的值
    int i;
    int j;
    elem e;
    
} Triple, *TriplePtr;

//构造压缩矩阵
typedef struct CompressedMatrix{
    
    int rows,columns,numElements;
    Triple* elements;
    
} CompressedMatrix, *CompressedMatrixPtr;

创建压缩矩阵

CompressedMatrixPtr initCompressedMatrix(int paraRows, int paraColumns, int paraElements, int** paraData){
    
    int i;
    CompressedMatrixPtr resultPtr = (CompressedMatrixPtr)malloc(sizeof(struct CompressedMatrix));
    resultPtr->rows = paraRows;
    resultPtr->columns = paraColumns;
    resultPtr->numElements = paraElements;
    resultPtr->elements = (TriplePtr)malloc(paraElements * sizeof(struct Triple));

    for(i = 0; i < paraElements; i++){
        resultPtr->elements[i].i = paraData[i][0];
        resultPtr->elements[i].j = paraData[i][1];
        resultPtr->elements[i].e = paraData[i][2];
    }

    return resultPtr;
}

打印矩阵

void printCompressedMatrix(CompressedMatrixPtr paraPtr){
    int i;
    for(i = 0; i < paraPtr->numElements; i++){
        printf("(%d, %d): %d\r\n", paraPtr->elements[i].i, paraPtr->elements[i].j, paraPtr->elements[i].e);
    }
}

转置压缩矩阵

CompressedMatrixPtr transposeCompressedMatrix(CompressedMatrixPtr paraPtr){
    
    //开辟空间
    int i, tempColumn, tempPosition;
    int *tempColumnCounts = (int*)malloc(paraPtr->columns * sizeof(int));
    int *tempOffsets = (int*)malloc(paraPtr->columns * sizeof(int));
    for(i = 0; i < paraPtr->columns; i++){
        tempColumnCounts[i] = 0;
    }

    CompressedMatrixPtr resultPtr = (CompressedMatrixPtr)malloc(sizeof(struct CompressedMatrix));
    resultPtr->rows = paraPtr->columns;
    resultPtr->columns = paraPtr->rows;
    resultPtr->numElements = paraPtr->numElements;

    resultPtr->elements = (TriplePtr)malloc(paraPtr->numElements * sizeof(struct Triple));
    
    //定位
    for(i = 0; i < paraPtr->numElements; i++){
        tempColumnCounts[paraPtr->elements[i].j]++;
    }
    tempOffsets[0] = 0;
    for(i = 1; i < paraPtr->columns; i++){
        tempOffsets[i] = tempOffsets[i - 1] + tempColumnCounts[i - 1];
        printf("tempOffsets[%d] = %d \r\n", i, tempOffsets[i]);
    }

    //填入值
    for(i = 0; i < paraPtr->numElements; i++){
        tempColumn = paraPtr->elements[i].j;
        tempPosition = tempOffsets[tempColumn];
        resultPtr->elements[tempPosition].i = paraPtr->elements[i].j;
        resultPtr->elements[tempPosition].j = paraPtr->elements[i].i;
        resultPtr->elements[tempPosition].e = paraPtr->elements[i].e;

        tempOffsets[tempColumn]++;
    }

    return resultPtr;
}

---

二、图示

 

 

 

---

 三、全部代码

//
//  main.c
//
//  Created on 2022/5/18.
//


#include <stdio.h>
#include <malloc.h>

typedef int elem;

typedef struct Triple{
    
    //i代表矩阵行数，j代表矩阵列数，e代表储存的值
    int i;
    int j;
    elem e;
    
} Triple, *TriplePtr;

//构造压缩矩阵
typedef struct CompressedMatrix{
    
    int rows,columns,numElements;
    Triple* elements;
    
} CompressedMatrix, *CompressedMatrixPtr;

//创建压缩矩阵
CompressedMatrixPtr initCompressedMatrix(int paraRows, int paraColumns, int paraElements, int** paraData){
    
    int i;
    CompressedMatrixPtr resultPtr = (CompressedMatrixPtr)malloc(sizeof(struct CompressedMatrix));
    resultPtr->rows = paraRows;
    resultPtr->columns = paraColumns;
    resultPtr->numElements = paraElements;
    resultPtr->elements = (TriplePtr)malloc(paraElements * sizeof(struct Triple));

    for(i = 0; i < paraElements; i++){
        resultPtr->elements[i].i = paraData[i][0];
        resultPtr->elements[i].j = paraData[i][1];
        resultPtr->elements[i].e = paraData[i][2];
    }

    return resultPtr;
}

//打印矩阵
void printCompressedMatrix(CompressedMatrixPtr paraPtr){
    int i;
    for(i = 0; i < paraPtr->numElements; i++){
        printf("(%d, %d): %d\r\n", paraPtr->elements[i].i, paraPtr->elements[i].j, paraPtr->elements[i].e);
    }
}

//转置压缩矩阵
CompressedMatrixPtr transposeCompressedMatrix(CompressedMatrixPtr paraPtr){
    
    //开辟空间
    int i, tempColumn, tempPosition;
    int *tempColumnCounts = (int*)malloc(paraPtr->columns * sizeof(int));
    int *tempOffsets = (int*)malloc(paraPtr->columns * sizeof(int));
    for(i = 0; i < paraPtr->columns; i++){
        tempColumnCounts[i] = 0;
    }

    CompressedMatrixPtr resultPtr = (CompressedMatrixPtr)malloc(sizeof(struct CompressedMatrix));
    resultPtr->rows = paraPtr->columns;
    resultPtr->columns = paraPtr->rows;
    resultPtr->numElements = paraPtr->numElements;

    resultPtr->elements = (TriplePtr)malloc(paraPtr->numElements * sizeof(struct Triple));
    
    //定位
    for(i = 0; i < paraPtr->numElements; i++){
        tempColumnCounts[paraPtr->elements[i].j]++;
    }
    tempOffsets[0] = 0;
    for(i = 1; i < paraPtr->columns; i++){
        tempOffsets[i] = tempOffsets[i - 1] + tempColumnCounts[i - 1];
        printf("tempOffsets[%d] = %d \r\n", i, tempOffsets[i]);
    }

    //填入值
    for(i = 0; i < paraPtr->numElements; i++){
        tempColumn = paraPtr->elements[i].j;
        tempPosition = tempOffsets[tempColumn];
        resultPtr->elements[tempPosition].i = paraPtr->elements[i].j;
        resultPtr->elements[tempPosition].j = paraPtr->elements[i].i;
        resultPtr->elements[tempPosition].e = paraPtr->elements[i].e;

        tempOffsets[tempColumn]++;
    }

    return resultPtr;
}

//测试
void compressedMatrixTest(){
    
    CompressedMatrixPtr tempPtr1, tempPtr2;
    int i, j, tempElements;

    //创建待转置的压缩矩阵
    tempElements = 4;
    int** tempMatrix1 = (int**)malloc(tempElements * sizeof(int*));
    for(i = 0; i < tempElements; i++){
        tempMatrix1[i] = (int*)malloc(3 * sizeof(int));
    }

    int tempMatrix2[4][3] = {{0, 0, 2}, {0, 2, 3}, {2, 0, 5}, {2, 1, 6}};
    for(i = 0; i < tempElements; i++){
        for(j = 0; j < 3; j++){
            tempMatrix1[i][j] = tempMatrix2[i][j];
        }
    }
    
    tempPtr1 = initCompressedMatrix(2, 3, 4, tempMatrix1);

    printf("After initialization.\r\n");
    printCompressedMatrix(tempPtr1);

    tempPtr2 = transposeCompressedMatrix(tempPtr1);
    printf("After transpose.\r\n");
    printCompressedMatrix(tempPtr2);
}

//main
int main(){
    
    compressedMatrixTest();

    return 0;
}

---

四、小结

压缩矩阵的目的：

存储矩阵的一般方法是采用二维数组，其优点是可以随机地访问每一个元素，因而能够较容易地实现矩阵的各种运算。

但对于稀疏矩阵而言，若用二维数组来表示，会重复存储了很多个0了，浪费空间，而且要花费时间来进行零元素的无效计算。所以必须考虑对稀疏矩阵进行压缩存储。

而且，压缩矩阵的计算也更加高效。