离散实验4

#include<iostream>
#include <iomanip>
#include<string>
using namespace std;

int main()
{
    int i, j;
    string C, R;
    cout << "输入集合：" << endl;
    cin >> C;
    cout << "关系：" << endl;
    cin >> R;

    string setA;
    int D = 0;
    for (i = 0; i < C.length();i++)
        if (C[i]>'a' && C[i] < 'z')
        {
            setA += C[i];
            D++;
        }
        string *CA = new string[D * 2];
        for (i = 0; i < D; i++)
            CA[i] = setA[i];
        string RA;
        for (i = 0; i < R.length(); i++)
            if (R[i]>'a' && R[i] < 'z')
                RA += R[i];
        int **M = new int*[D];
        for (i = 0; i < D; i++)
            M[i] = new int[D];
        
        for (i = 0; i < D; i++)
            for (j = 0; j < D; j++)
                M[i][j] = 0;
        for (i = 0; i < RA.length(); i += 2)
            M[RA[i] - 'a'][RA[i + 1] - 'a'] = 1;
        cout << "矩阵：" << endl;

        for (i = 0; i < D; i++)
            for (j = 0; j < D; j++)
            {
                cout << M[i][j] << " ";
                if (j == D - 1)
                    cout <<endl;
            }
            cout << endl;

            cout << "简化矩阵" << endl;

            for (i = 1; i < D; i++)
                for (j = 0; j < i; j++)
                {
                    cout << M[i][j] << " ";
                    if (j == i - 1)
                        cout << endl;
                }
                cout << endl;

                if (D == 1)
                {
                    cout << "该关系极大相容类:" << endl;
                    return 0;
                }

                int DA =D,DB = D;
                string strA, strB, strC;
                if (D > 1)
                {
                    for (i = DB - 2; i >= 0; i--)
                    {
                        for (j = i + 1; j < DB; j++)
                            if (M[j][i] == 1)
                                strA += char('a' + j);
                        for (j = 0; j < D; j++)
                        {
                            for (int k = 0; k < CA[j].length(); k++)
                                for (int m = 0; m < strA.length();m++)
                                if (CA[j][k] == strA[m])
                                    strB += strA[m];

                            if (strB.length() != 0)
                            {
                                strC = strB;
                                strB = char('a' + 1);
                                strB += strC;
                                CA[DA] = strB;
                                DA++;
                                strC = " ";
                                strB = " ";
                            }
                        }
                        strA = " ";
                        D = DA;
                        int flag = 0;
                        for (j = 0; j < D; j++)
                            for (int k = j + 1; k < D; k++)
                            {
                                for (int l = 0; l < CA[j].length(); l++)
                                    for (int  m = 0; m < CA[k].length(); m++)
                                        if (CA[j][l] == CA[k][m])
                                            flag++;
                                if (flag != 0 && flag == CA[j].length())
                                {
                                    CA[j] = " ";
                                    DA--;
                                }
                                if (flag != 0 && flag == CA[k].length())
                                {
                                    CA[k] = " ";
                                    DA--;
                                }
                                flag = 0;
                            }
                            for (j = 0; j < D; j++)
                                for (int k = 0; k < D - 1; k++)
                                    if (CA[k] == " " && CA[k + 1] != " ")
                                    {
                                        CA[k] = CA[k + 1];
                                        CA[k + 1] = " ";
                                    }
                                    for (j = 0; j < D; j++)
                                        cout << setw(5) << CA[j];
                                    cout << endl;
                    }
                }
                cout << endl;
                cout << "极大相容类：" << endl;
                for (i = 0; i < D; i++)
                {
                    cout << "{";
                    for (j = 0; j < CA[i].length(); j++)
                    {
                        cout << CA[i][j];
                        if (j != CA[i].length() - 1)
                            cout << ",";
                    }
                    cout << "}";
                    if (i != D - 1)
                        cout << ",";
                }
                cout << endl;
                return 0;

}

#include <stdio.h>
#include <stdlib.h>
#define MAXedg 100
#define MAX 0
#define N 4  //着色的颜色数
int color[30]={0};//来存储对应块的对应颜色
typedef char vextype;
typedef int adjtype;
typedef struct     //定义图
{
    vextype vexs[MAXedg];  //存放边的矩阵
    adjtype arcs[MAXedg][MAXedg];  //图的邻接矩阵
    int vnum,arcnum;     //图的顶点数和边数
}Graph;
//***********************************************************
int LocateVex(Graph G,char u)
{ 
    int i;
    for(i=1;i<=G.vnum;i++)
    { 
       if(u==G.vexs[i]) 
       return i;
    }
    if(i==G.vnum) 
   {  
      printf("Error u!
");
      exit(1);
   }
   return 0;
}
//**********************************************************
void CreateGraph(Graph &G)   //输入图
{
    int i,j,k, w;
    vextype v1,v2;
    printf("输入图的顶点数和边数:
");
    scanf("%d%d",&G.vnum,&G.arcnum);
    getchar();
    printf("输入图的各顶点：
");
    for(i=1;i<=G.vnum;i++)
    {
        scanf("%c",&G.vexs[i]); 
        getchar();
    } 
    for(i=0;i<=G.vnum;i++)
    for(j=0;j<=G.vnum;j++)
    G.arcs[i][j]=MAX;
    printf("输入边的两个顶点和权值(均用1表示):
");
    for(k=0;k<G.arcnum;k++)
    {
        scanf("%c", &v1);getchar();
        scanf("%c", &v2);getchar();
        scanf("%d", &w); getchar();  
        i=LocateVex(G,v1);
        j=LocateVex(G,v2);
        G.arcs[i][j]=w;
        G.arcs[j][i]=w;
    }
}
//****************************************************************
void PrintGraph(Graph G)   //输出图的信息
{
    int i,j;
    printf("图的各顶点：
");
    for(i=1;i<=G.vnum;i++)
        printf("%c ",G.vexs[i]);
    printf("
");
    printf("图的邻接矩阵：
");
 for(i=1;i<=G.vnum;i++)
 {
     for(j=1;j<=G.vnum;j++)
     printf("%d  ",G.arcs[i][j]);
     printf("
");
 }
}
//******************************************************************
int colorsame(int s,Graph G)//判断这个颜色能不能满足要求
{
    int i,flag=0;
    for(i=1;i<=s-1;i++)//分别与前面已经着色的几块比较
        if(G.arcs[i][s]==1&&color[i]==color[s])
        {
　　　　　　flag=1;break;
　　　　}
    return flag;
}
//******************************************************************
void output(Graph G)//输出函数
{
    int i;
    for(i=1;i<=G.vnum;i++)
        printf("%d ",color[i]);
    printf("
");
}
//******************************************************************
void trycolor(int s,Graph G)//s为开始图色的顶点，本算法从1开始
{
    int i;
    if(s>G.vnum)//递归出口
    {
        output(G);
        exit(1);
    }
    else
    {
        for(i=1;i<=N;i++)//对每一种色彩逐个测试
        {
            color[s]=i;
            if(colorsame(s,G)==0)
                trycolor(s+1,G);//进行下一块的着色
        }
    }
}
//*****************************************************************
int main()
{ 
    Graph G;
    CreateGraph(G);
    PrintGraph(G);
    printf("着色方案:
");  
    trycolor(1,G);
    return 0;
}