两个必要张

//===================MCC_Header.h==================
    //头文件支持
#include<iostream>
#include<iomanip>
#include<vector>
    using namespace std;
//用typedef定义类型
typedef vector<char> Collection;
typedef vector<vector<char> > Matrix;
//相关函数
//输出集合
void Coll_Print(Collection C);
//输出集类
void Matrix_Print(Matrix M);
//定位元素在集合中的位置
int Coll_ChLocate(Collection C, char ch);
//判断字符元素是否属于集合
bool Coll_ChFind(Collection Ca, char ch);
//判断集合(一维向量)是否属于集类(二维向量)
bool Matrix_ColFind(Matrix M, Collection C);
//判断集合是否包含于集合
bool Coll_Belong(Collection Ca, Collection Cb);
//集合交
Collection Coll_Or(Collection Ca, Collection Cb);
//集合并
Collection Coll_And(Collection Ca, Collection Cb);
//集类并
Matrix Matrix_Or(Matrix Ma, Matrix Mb);
//集类减运算
Matrix Matrix_Minus(Matrix Ma, Matrix Mb);
//关系矩阵算法
void Make_MCC(Collection Ca, vector<Collection> &pi, vector<vector<bool> > R);
    //=================MCC_Function.cpp===============
#include"MCC_Header.h"
    //输出集合
 void Coll_Print(Collection C)
{
    cout << "{";
    for (int i = 0; i < C.size(); i++)
    {
        cout << C[i];
        if (i != C.size() - 1)
            cout << ",";
    }
    cout << "}";
}
//输出集类
void Matrix_Print(Matrix M)
{
    cout << "{  ";
    for (int i = 0; i < M.size(); i++)
    {
        Coll_Print(M[i]);
        if (i != M.size() - 1)
            cout << ",";
    }
    cout << "  }" << endl;

}
//定位元素在集合中的位置
int Coll_ChLocate(Collection C, char ch)
{
    for (int i = 0; i < C.size(); i++)
        if (C[i] == ch)
            return i;

    return -1;
}
//判断字符元素是否属于集合
bool Coll_ChFind(Collection Ca, char ch)
{
    for (int i = 0; i < Ca.size(); i++)
    {
        if (Ca[i] == ch)
            return true;
    }

    return false;
}
//判断集合(一维向量)是否属于集类(二维向量)
bool Matrix_ColFind(Matrix M, Collection C)
{
    for (int i = 0; i < M.size(); i++)
        if (M[i] == C)
            return true;

    return false;
}
//判断集合Ca是否包含于集合Cb
bool Coll_Belong(Collection Ca, Collection Cb)
{
    if (Ca.size() > Cb.size())
        return false;
    else
    {
        for (int i = 0; i < Ca.size(); i++)
        {
            if (!Coll_ChFind(Cb, Ca[i]))
                return false;
        }

        return false;
    }

}
//集合交
Collection Coll_Or(Collection Ca, Collection Cb)
{
    int min = (Ca.size() > Cb.size() ? Cb.size() : Ca.size());

    Collection CB = (Ca.size() > Cb.size() ? Ca : Cb);
    Collection CS = (Ca.size() > Cb.size() ? Cb : Ca);

    Collection Cc;

    for (int i = 0; i < min; i++)
    {
        if (Coll_ChFind(CB, CS[i]))
            Cc.push_back(CS[i]);
    }

    return Cc;
}
//集合并
Collection Coll_And(Collection Ca, Collection Cb)
{
    int min = (Ca.size() > Cb.size() ? Cb.size() : Ca.size());

    Collection CB = (Ca.size() > Cb.size() ? Ca : Cb);
    Collection CS = (Ca.size() > Cb.size() ? Cb : Ca);


    for (int i = 0; i < min; i++)
    {
        if (!Coll_ChFind(CB, CS[i]))
            CB.push_back(CS[i]);
    }
    return CB;
}
//集类并
Matrix Matrix_Or(Matrix Ma, Matrix Mb)
{
    int min = (Ma.size() > Mb.size() ? Mb.size() : Ma.size());
    Matrix MB = (Ma.size() > Mb.size() ? Ma : Mb);
    Matrix MS = (Ma.size() > Mb.size() ? Mb : Ma);

    for (int i = 0; i < min; i++)
        if (!Matrix_ColFind(MB, MS[i]))
            MB.push_back(MS[i]);

    return MB;
}
//集类减运算
Matrix Matrix_Minus(Matrix Ma, Matrix Mb)
{
    int i, min = (Ma.size() > Mb.size() ? Mb.size() : Ma.size());
    Matrix Mc;

    for (i = 0; i < min; i++)
    {
        if (!Matrix_ColFind(Mb, Ma[i]))
            Mc.push_back(Ma[i]);
    }
    if (min == Ma.size())
        return Mc;
    else
    {
        for (; i < Ma.size(); i++)
            Mc.push_back(Ma[i]);
        return Mc;
    }
}
//关系矩阵算法
void Make_MCC(Collection Ca, vector<Collection> &pi, vector<vector<bool> > R)
{
    int n = Ca.size(), i, j, k;
    Collection A = Ca, Xi;
    Collection S, S1, S2, Col_temp1, Col_temp2;
    vector<Collection> Mat_temp1, Mat_temp2;

    if (n == 1)
    {
        cout << "Can't Creat the MCC!
";
        return;
    }
    //关系矩阵算法(详参见教材P108)
    for (i = n - 1; i > 1; i--)
    {
        Xi.clear();
        Xi.push_back(Ca[i - 1]);

        A.clear();
        for (j = i + 1; j <= n; j++)
        {
            if (R[j - 1][i - 1])
                A.push_back(Ca[j - 1]);
        }
        for (k = 0; k < pi.size(); k++)
        {
            S = pi[k];
            if ((Coll_And(S, A)).size() != 0)
            {
                Col_temp1.clear();
                Col_temp2.clear();

                Col_temp1 = Coll_And(S, A);
                Col_temp2 = Coll_Or(Xi, Col_temp1);

                Mat_temp1.clear();
                Mat_temp1.push_back(Col_temp2);


                pi = Matrix_Or(pi, Mat_temp1);
            }
        }
        for (i = 0; i < pi.size(); i++)
        {
            S1.clear();
            S1 = pi[i];
            for (j = 0; j < pi.size(); j++)
            {
                S2.clear();
                S2 = pi[j];
                if (Coll_Belong(S1, S2))
                {
                    Mat_temp2.clear();
                    Mat_temp2.push_back(S1);

                    pi = Matrix_Minus(pi, Mat_temp2);
                }
            }
        }
    }
}
#include"MCC_Header.h"
int main()
{
    Collection A;
    Matrix pi;
    vector<vector<bool> > R;
    char ch, ch1, ch2;
    int number, i, j;
    //输入A中元素的个数
    cout << "Please Input The Number Of A's Elements:
";
    cin >> number;
    //输入A中的各个元素
    cout << "Please Input Each Element Of A:
";
    for (i = 0; i < number; i++)
    {
        cin >> ch;
        A.push_back(ch);
    }
    //输出集合A
    cout << "Output A As Followed:
";
    cout << "A=";
    Coll_Print(A);
    cout << endl;
    //初始化关系矩阵R并输出
    vector<bool> bl_temp(A.size(), 0);
    for (i = 0; i < A.size(); i++)
        R.push_back(bl_temp);
    cout << "Initialize Matrix R AS 0 Matrix And Output As Followed:
";
    for (i = 0; i < R.size(); i++)
    {
        for (j = 0; j < R[0].size(); j++)
            cout << R[i][j] << " ";
        cout << endl;
    }
    //请输入序偶(以#字符结束输入)来重置矩阵并输出
    cout << "Now,Type The T_Char To ReInitialize R:
";
    while (cin >> ch1 >> ch2 && ch1 != '#')
    {
        R[Coll_ChLocate(A, ch1)][Coll_ChLocate(A, ch2)] = 1;
    }
    cout << "Output Matrix R as Followed:
";
    for (i = 0; i < R.size(); i++)
    {
        for (j = 0; j < R[0].size(); j++)
            cout << R[i][j] << " ";
        cout << endl;
    }
    //初始化pi并输出
    vector<char> ch_temp;
    for (i = 0; i < A.size(); i++)
    {
        ch_temp.clear();
        ch_temp.push_back(A[i]);
        pi.push_back(ch_temp);
    }
    cout << "Initialize Matrix pi And Output As Followed:
";
    cout << "pi=
";
    Matrix_Print(pi);
    //调用关系矩阵函数
    Make_MCC(A, pi, R);
    cout << "The Maximal_Consistent_Class Have Been Created As Followed:
";
    for (i = 0; i < pi.size(); i++)
    {
        Coll_Print(pi[i]);
        cout << endl;
    }
    return 0;
}

#include<stdio.h>
#include<stdlib.h>
typedef enum { ERROR, OK } Status;
typedef struct
{
    int row, line;
}PosType;

typedef struct
{
    int  di, ord;
    PosType seat;
}SElemType;

typedef struct
{
    SElemType * base;
    SElemType * top;
    int        stacksize;
}SqStack;

Status InitStack(SqStack &S);
Status Push(SqStack &S, SElemType &a);
Status Pop(SqStack &S, SElemType &a);
Status StackEmpty(SqStack S);
Status MazePath(int maze[12][12], SqStack &S, PosType start, PosType end);
void Initmaze(int maze[12][12], int size);
void printmaze(int maze[12][12], int size);
Status Pass(int maze[12][12], PosType CurPos);
void Markfoot(int maze[12][12], PosType CurPos);
PosType NextPos(PosType CurPos, int Dir);
void printpath(int maze[12][12], SqStack S, int size);
void main(void)
{
    SqStack S;
    int size, maze[12][12];
    for (int n = 0; n < 10; n++)
    {
        printf("创建一个正方形迷宫，请输入迷宫尺寸(注意不要大于50):
");
        scanf("%d", &size);
        if (size < 1 || size>10)
        { 
            printf("输入错误!");
            return;
        }
        Initmaze(maze, size);
        printmaze(maze, size);
        PosType start, end;
        printf("输入入口行坐标和列坐标:");
        scanf("%d", &start.row); 
        scanf("%d", &start.line);
        printf("输入出口行坐标和列坐标:");
        scanf("%d", &end.row);
        scanf("%d", &end.line);
        if (MazePath(maze, S, start, end))
            printpath(maze, S, size);
        else
            printf("找不到通路!

");
    }
}
Status MazePath(int maze[12][12], SqStack &S, PosType start, PosType end)
{
    PosType curpos;
    int curstep;
    SElemType e;
    InitStack(S);
    curpos = start;
    curstep = 1;
    do {
        if (Pass(maze, curpos))
        {
            Markfoot(maze, curpos);
            e.di = 1;
            e.ord = curstep;
            e.seat = curpos;
            Push(S, e);
            if (curpos.row == end.row && curpos.line == end.line)
                return OK;
            curpos = NextPos(curpos, 1);
            curstep++;
        }
        else
        {
            if (!StackEmpty(S))
            {
                Pop(S, e);
                while (e.di == 4 && !StackEmpty(S))
                {
                    Markfoot(maze, e.seat);
                    Pop(S, e);
                }
                if (e.di < 4)
                {
                    e.di++;
                    Push(S, e);
                    curpos = NextPos(e.seat, e.di);
                }
            }
        }
    } while (!StackEmpty(S));
    return ERROR;
}
void Initmaze(int maze[12][12], int size)
{
    char select;
    printf("选择创建方式 A:自动生成 B:手动创建
");
label:scanf("%c", &select);
    if (select == 'a' || select == 'A')
    {
        for (int i = 0; i < size + 2; i++)
            maze[0][i] = 1;
        for (int i = 1; i < size + 1; i++)
        {
            maze[i][0] = 1;
            for (int j = 1; j < size + 1; j++)
                maze[i][j] = rand() % 2;
            maze[i][size + 1] = 1;
        }
        for (int i = 0; i < size + 2; i++)
            maze[size + 1][i] = 1;
    }
    else if (select == 'b' || select == 'B')
    {
        printf("按行输入%d*%d数据,0代表可通,1代表不可通(每行以Enter结束):
", size, size);
        for (int i = 0; i < size + 2; i++)maze[0][i] = 1;
        for (int i = 1; i < size + 1; i++)
        {
            maze[i][0] = 1;
            for (int j = 1; j < size + 1; j++)
                scanf("%d", &maze[i][j]);
            maze[i][size + 1] = 1;
        }
        for (int i = 0; i < size + 2; i++)
            maze[size + 1][i] = 1;
    }
    else if (select == '
')
        goto label;
    else printf("输入错误!");
}
void printmaze(int maze[12][12], int size)//
{
    printf("

");
    printf("显示所建的迷宫(#表示外面的墙):
");
    for (int i = 0; i < size + 2; i++)
        printf("%c ", '#');
    printf("
");
    for (int i = 1; i < size + 1; i++)
    {
        printf("%c ", '#');
        for (int j = 1; j < size + 1; j++)
        {
            printf("%d ", maze[i][j]);
        }
        printf("%c", '#');
        printf("
");
    }
    for (int i = 0; i < size + 2; i++)
        printf("%c ", '#');
    printf("
");

}

void printpath(int maze[12][12], SqStack S, int size)
{
    printf("

通路路径为:
");
    SElemType * p = S.base;
    while (p != S.top)
    {
        maze[p->seat.row][p->seat.line] = 2;
        p++;
    }
    for (int i = 0; i < size + 2; i++)
        printf("%c ", '#'); printf("
");
    for (int i = 1; i < size + 1; i++)
    {
        printf("%c ", '#');
        for (int j = 1; j < size + 1; j++)
        {
            if (maze[i][j] == 2) 
                printf("%c ", '0');
            else              
                printf(" ");
        }
        printf("%c", '#');
        printf("
");
    }
    for (int i = 0; i < size + 2; i++)
        printf("%c ", '#'); 
    printf("

");

}

Status Pass(int maze[12][12], PosType CurPos)
{
    if (maze[CurPos.row][CurPos.line] == 0)
        return OK;
    else 
        return ERROR;
}
void Markfoot(int maze[12][12], PosType CurPos)
{
    maze[CurPos.row][CurPos.line] = 1;
}
PosType NextPos(PosType CurPos, int Dir)
{
    PosType ReturnPos;
    switch (Dir)
    {
    case 1:
        ReturnPos.row = CurPos.row;
        ReturnPos.line = CurPos.line + 1;
        break;
    case 2:
        ReturnPos.row = CurPos.row + 1;
        ReturnPos.line = CurPos.line;
        break;
    case 3:
        ReturnPos.row = CurPos.row;
        ReturnPos.line = CurPos.line - 1;
        break;
    case 4:
        ReturnPos.row = CurPos.row - 1;
        ReturnPos.line = CurPos.line;
        break;
    }
    return ReturnPos;
}
Status InitStack(SqStack &S)
{
    S.base = (SElemType *) malloc(100 * sizeof(SElemType));
    if (!S.base)return ERROR;
    S.top = S.base;
    S.stacksize = 100;
    return OK;
}
Status Push(SqStack &S, SElemType &a)
{
    *S.top++ = a;
    return OK;
}
Status Pop(SqStack &S, SElemType &a)
{
    if (S.top == S.base)
        return ERROR;
    a = *--S.top;
    return OK;
}

Status StackEmpty(SqStack S)
{
    if (S.top == S.base)
        return OK;
    return ERROR;
}