三元组存以及十字链表的创建

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include<fstream>
#define _CRT_SECURE_NO_WARNINGS
using namespace std;

struct TripleArray
{
    int row;//行
    int col;//列
    int val;//值
};
//三元表

int row = 1;//记录元数组行数
int col = 0;//记录元数组列数
int arr[11][11];//元数组
int MartNumb = 1;//记录三元组个数=非零元个数
TripleArray MariA[200];//三元组
TripleArray MariB[200];//三元组

/*十字链表的结构类型定义如下：*/
typedef struct OLNode
{
    int row;
    int col; 
    int value;
    OLNode* right; 
    OLNode* down;
};

typedef struct
{
    OLNode** row_head;
    OLNode** col_head;
    int totalrow;
    int totalcol;
    int NotZeroNumbs;
} CrossList;

void CreateCrossList(CrossList* M)
{
    OLNode* p;
    OLNode* q;

    M->totalrow = row;
    M->totalcol =col;
    M->NotZeroNumbs = MartNumb;

    //开辟空间
    if (!(M->row_head = (OLNode**)malloc(row * sizeof(OLNode*))))
        exit(OVERFLOW);
    if (!(M->col_head = (OLNode**)malloc(col * sizeof(OLNode*))))
        exit(OVERFLOW);
    /*初始化行、列，头指针指向量，各行、列链表为空的链表*/
    for (int h = 1; h <=row; h++)
    {
        M->row_head[h] = NULL;
    }
    for (int t = 1; t <=col; t++)
    {
        M->col_head[t] = NULL;
    }

    for (int i=1;i<=row;i++)
        for (int j = 1; j <= col; j++)
        {
            if (arr[i][j] != 0)
            {
                if (!(p = (OLNode*)malloc(sizeof(OLNode))))
                    exit(OVERFLOW);

                p->row = i;
                p->col = j;
                p->value = arr[i][j];

                if (M->row_head[i] == NULL)
                {
                    M->row_head[i] = p;
                    p->right = NULL;
                }
                else
                {
                    /*寻找行表中的插入位置*/
                    for (q = M->row_head[i]; q->right && q->right->col < j; q = q->right);
                    p->right = q->right;
                    q->right = p; /*完成插入*/
                }
                if (M->col_head[j] == NULL)
                {
                    M->col_head[j] = p;
                    p->down = NULL;
                }
                else
                {
                    //寻找列表中的插入位置
                    for (q = M->col_head[j]; q->down && q->down->row < i; q = q->down);
                    p->down = q->down;
                    q->down = p;
                }
            }
        }
}

//创建三元组
void CreateTripleArray()
{
    for (int i = 1; i <= row; i++)
    {
        for (int j = 1; j <= col; j++)
        {
            if (arr[i][j] != 0)//如果非零就存进去
            {
                MariA[MartNumb].col = j;
                MariA[MartNumb].row = i;
                MariA[MartNumb].val = arr[i][j];
                MartNumb++;
            }
        }
    }
}

void SortMartic()
{
    //冒泡排序
    for (int i = 1; i < MartNumb-1; i++)
    {
        for (int j = i + 1; j < MartNumb; j++)
        {
            if (MariA[i].row > MariA[j].row)
            {
                int temp;
                temp = MariA[i].row;
                MariA[i].row = MariA[j].row;
                MariA[j].row = temp;

                int temp2;
                temp2 = MariA[i].col;
                MariA[i].col = MariA[j].col;
                MariA[j].col = temp2;

                int temp3 = MariA[i].val;
                MariA[i].val = MariA[j].val;
                MariA[j].val = temp3;
            }
            //假如行数相同比较列数
            else if (MariA[i].row == MariA[j].row && MariA[i].col > MariA[j].col)
            {
                int temp2;
                temp2 = MariA[i].col;
                MariA[i].col = MariA[j].col;
                MariA[j].col = temp2;

                int temp3 = MariA[i].val;
                MariA[i].val = MariA[j].val;
                MariA[j].val = temp3;
            }
        }
    }
}

void OverTurnMart()
{
    int q = 1;
    for (int k = 1; k <= col; k++)
    {
        for (int p = 1; p < MartNumb; p++)
        {
            if (MariA[p].col == k)
            {
                MariB[q].row = MariA[p].col;
                MariB[q].col = MariA[p].row;
                MariB[q].val = MariA[p].val;
                q++;
            }
        }
    }
}

int main()
{
    //文件读取矩阵操作
    FILE* fp = fopen("datamatrix.txt", "r");
    if (fp == NULL)
        return 0;
    int a = fgetc(fp);
    while (a != EOF)
    {
        //数字操作（可能两位数）
        if (a - '0' >= 0 && a - '0' <= 9)
        {
            int sum = a - '0';
            a = fgetc(fp);
            while (a - '0' >= 0 && a - '0' <= 9)
            {
                sum = sum * 10 + a - '0';
                a = fgetc(fp);
            }
            col++;
            arr[row][col] = sum;
        }
        if (a == '\n')
        {
            row++;
            col = 0;
        }
        a = fgetc(fp);
    }

    cout << "row:" << row << endl;
    cout << "col:" << col << endl;

    cout << "数组是：" << endl;
    for (int i = 1; i <= row; i++)
    {
        for (int j = 1; j <= col; j++)
            cout << arr[i][j] << " ";
        cout << endl;
    }

    //创建三元组
    CreateTripleArray();

    fstream Output1;
    Output1.open("matrix.txt", ios::out);
    cout << "三元组是:" << endl;
    for (int i = 1; i < MartNumb; i++)
    {
        cout << MariA[i].row << " " << MariA[i].col << " " << MariA[i].val << endl;
        Output1<< MariA[i].row << " " << MariA[i].col << " " << MariA[i].val << endl;
    }
    Output1.close();

    cout << "选择转置方式（1或2）" << endl;
    int choice;
    cin >> choice;
   
    if (choice == 1)
    {
        cout << "矩阵转置1" << endl;
        fstream Output2;
        Output2.open("matrix-a.txt", ios::out);
        for (int i = 1; i < MartNumb; i++)
        {
            int t = MariA[i].col;
            MariA[i].col = MariA[i].row;
            MariA[i].row = t;
        }
        cout << "排序" << endl;
        SortMartic();
        for (int i = 1; i < MartNumb; i++)
        {
            cout << MariA[i].row << " " << MariA[i].col << " " << MariA[i].val << endl;
            Output2 << MariA[i].row << " " << MariA[i].col << " " << MariA[i].val << endl;
        }
        Output2.close();
    }
    else if (choice == 2)
    {
        cout << "矩阵转置2" << endl;
        fstream Output3;
        Output3.open("matrix-b.txt", ios::out);
        OverTurnMart();
        for (int i = 1; i < MartNumb; i++)
        {
            cout << MariB[i].row << " " << MariB[i].col << " " << MariB[i].val << endl;
            Output3 << MariB[i].row << " " << MariB[i].col << " " << MariB[i].val << endl;
        }
        Output3.close();
    }

    //创建十字链表
    CrossList M;
    CreateCrossList(&M);

    fstream Output4;
    Output4.open("matrix-c.txt", ios::out);
    cout << "遍历所有行非零元素" << endl;
    for (int i = 1; i <= row; i++)
    {
        OLNode* pCur = M.row_head[i];
        while (pCur != NULL)
        {
            cout << pCur->row << " " << pCur->col << " " << pCur->value << endl;
            Output4<< pCur->row << " " << pCur->col << " " << pCur->value << endl;
            pCur = pCur->right;
        }
    }
    Output4.close();

    return 0;
}