#include "mainwindow.h"
#include "ui_mainwindow.h"

MainWindow::MainWindow(QWidget *parent) :
    QMainWindow(parent),
    ui(new Ui::MainWindow)
{
    ui->setupUi(this);
    connect(ui->spinBox,SIGNAL(valueChanged(int)),this,SLOT(changeMatrix(int)));
    connect(ui->pushButton,SIGNAL(clicked()),this,SLOT(count()));
}

MainWindow::~MainWindow()
{
    delete ui;
}
void MainWindow::changeMatrix(int number)
{
    ui->tableWidget->setColumnCount(number);
    ui->tableWidget->setRowCount(number);

}
void MainWindow::check()
{
    std::cout<<"Checking..."<<std::endl;
    int notfound = 0;
    bool deleated = 0, remove = 0;
    std::cout<<"Result vector:"<<std::endl;
    for(unsigned int i=0; i<result.size();i++)
    {
        std::cout<<result[i]->value<<": ";
        for (std::map<unsigned int,bool>::iterator it=result[i]->Map.begin(); it!=result[i]->Map.end(); ++it)
        {
            std::cout<<it->first<<" "<<it->second<<" ";
        }
        std::cout<<std::endl;
    }
    std::cout<<"New element:"<<std::endl;
    std::cout<<newel->value<<": ";
    for (std::map<unsigned int,bool>::iterator it=newel->Map.begin(); it!=newel->Map.end(); ++it)
    {
        std::cout<<it->first<<" "<<it->second<<" ";
    }
    std::cout<<std::endl;
    for(unsigned int i=0; i<result.size();i++)
    {
        if(result[i]->Map.size()<newel->Map.size())
        {
            for (std::map<unsigned int,bool>::iterator it=result[i]->Map.begin(); it!=result[i]->Map.end(); ++it)
            {
                std::cout<<"Searching0: "<<it->first<<" end: "<<newel->Map.end()->first<<std::endl;
                if(newel->Map.find(it->first)==newel->Map.end()/*&&newel->Map.end()->first!=it->first*/)
                {
                    std::cout<<"Not found0: "<<std::endl;
                    notfound++;
                    break;
                }

            }
            if(notfound==0)
                if(result[i]->value>=newel->value)
                {
                    std::cout<<"Coinsidense => element should be deleated"<<std::endl;
                    deleated = 1;
                    break;
                }
            notfound = 0;
        }
        if(result[i]->Map.size()>=newel->Map.size())
        {
            for (std::map<unsigned int,bool>::iterator it=newel->Map.begin(); it!=newel->Map.end(); ++it)
            {
                std::cout<<"Searching1: "<<it->first<<" end: "<<result[i]->Map.end()->first<<std::endl;
                if(result[i]->Map.find(it->first)==result[i]->Map.end()/*&&result[i]->Map.end()->first!=it->first*/)
                {
                    std::cout<<"Not found1: "<<std::endl;
                    notfound++;
                    break;
                }



            }
            if(notfound==0)
            {
                if(result[i]->value<=newel->value)
                {
                    std::cout<<"Coinsidense => element in vector should be deleated"<<std::endl;
                    std::cout<<"Checking from the begining..."<<std::endl;
                    result.erase(result.begin()+i);
                    remove = 1;
                    break;
                }
                else
                {
                    if(result[i]->Map.size()==newel->Map.size()) {
                        deleated = 1;
                        break;
                    }
                    else {
                        deleated = 0;

                    }
                }
            }
            notfound = 0;

        }


    }

    if(!deleated||remove)
    {
        result.push_back(newel);
        std::cout<<"Adding new element"<<std::endl;
    }
    std::cout<<"Checking finished"<<std::endl;
}
void MainWindow::minimize(std::vector<std::vector<double> > matrix)
{
    for(unsigned int i=0; i<matrix.size(); i++)
    {
        newel = new Mystruct;
        Mystruct *firstelem = new Mystruct;
        double min = matrix[i][0];
        for(int j=0; j<matrix.size(); j++)
        {
            min = std::min(min,matrix[i][j]);
        }
        firstelem->value = matrix[i][0];
        firstelem->Map[i] = 1;
        newel->value = min;
        newel->Map[i] = 1;
       // result.push_back(newel);
        iterator.push_back(firstelem);
    }
    for(unsigned int i=1; i<matrix.size(); i++)
    {
        std::cout<<"====================Itaration "<<i<<std::endl;
        for(unsigned int j = 0; j<iterator.size(); j++)
        {
           for(unsigned int k = 0; k<matrix.size(); k++)
           {
              newel = new Mystruct;
              newel->value = std::min(iterator[j]->value,matrix[k][i]);
              for (std::map<unsigned int,bool>::iterator it=iterator[j]->Map.begin(); it!=iterator[j]->Map.end(); ++it)
              {
              //newel->Map = iterator[j]->Map;
                  newel->Map[it->first] = 1;
              }
               newel->Map[k] = 1;
               this->check();


           }



        }
        iterator = result;
        result.clear();
    }
}

void MainWindow::count()
{
    std::vector<std::vector<double> > matrix, matrix2, matrix3;
    std::vector<double> newline;
    QTableWidgetItem *newItem;
    QString newdata;
    ui->textBrowser->clear();
    double Mbuf = 0, min = 0;

    for(int i=0; i<ui->tableWidget->columnCount(); i++)
    {
        for(int j=0; j<ui->tableWidget->columnCount(); j++)
        {
            newline.push_back(ui->tableWidget->item(i,j)->text().toDouble());

        }

        matrix.push_back(newline);
        matrix2.push_back(newline);
        matrix3.push_back(newline);
        newline.clear();
    }
    for(int i=0; i<matrix.size(); i++)
    {
        for(int j=0; j<matrix.size(); j++)
            std::cout<<matrix[i][j]<<" ";
        std::cout<<std::endl;
    }
    for(unsigned int l = 0; l<matrix.size()-1; l++)
    {
        for(unsigned int k = 0; k<matrix.size(); k++)
            for(unsigned int i = 0; i<matrix.size(); i++)
            {
                for(unsigned int j = 0; j<matrix.size(); j++)
                {
                    min = std::min(matrix2[k][j],matrix[j][i]);
                    if(min>Mbuf)
                        Mbuf = min;
                }

                matrix3[k][i] = Mbuf;
                Mbuf = 0;
            }
        matrix2 = matrix3;
    }
    ui->tableWidget_2->setColumnCount(matrix3.size());
    ui->tableWidget_2->setRowCount(matrix3.size());
    for(unsigned int i=0; i<matrix2.size(); i++)
        matrix2[i][i]=1;
    for(unsigned int i=0; i<matrix3.size(); i++)
        for(unsigned int j=0; j<matrix3.size(); j++)
        {
            newItem = new QTableWidgetItem();
          //  newdata.number(matrix[i][j]);
            newdata = QString::number(matrix2[i][j]);
            qDebug()<<matrix2[i][j];
            newItem->setText(newdata);
            qDebug()<<newdata;
            ui->tableWidget_2->setItem(i,j,newItem);

        }
    this->minimize(matrix2);
    ui->textBrowser->append("Базы:");
    this->showResult();
    iterator.clear();
    for(unsigned int i = 0; i<matrix2.size(); i++)
    {
        for(unsigned int j = 0; j<matrix2.size(); j++)
            matrix3[j][i] = matrix2[i][j];

    }
    this->minimize(matrix3);
    ui->textBrowser->append("Антибазы:");
    this->showResult();
    iterator.clear();
    for(unsigned int i = 0; i<matrix2.size(); i++)
    {
        for(unsigned int j = 0; j<matrix2.size(); j++)
            matrix3[i][j] = std::min(matrix2[i][j],matrix2[j][i]);

    }
    this->minimize(matrix3);
    ui->textBrowser->append("Сильная связность:");
    this->showResult();
    iterator.clear();
//    for(unsigned int i=0; i<matrix2.size(); i++)
//    {
//        newel = new Mystruct;
//        Mystruct *firstelem = new Mystruct;
//        double min = matrix2[i][0];
//        for(int j=0; j<matrix2.size(); j++)
//        {
//            min = std::min(min,matrix2[i][j]);
//        }
//        firstelem->value = matrix2[i][0];
//        firstelem->Map[i] = 1;
//        newel->value = min;
//        newel->Map[i] = 1;
//       // result.push_back(newel);
//        iterator.push_back(firstelem);
//    }
//    for(unsigned int i=1; i<matrix2.size(); i++)
//    {
//        std::cout<<"====================Itaration "<<i<<std::endl;
//        for(unsigned int j = 0; j<iterator.size(); j++)
//        {
//           for(unsigned int k = 0; k<matrix2.size(); k++)
//           {
//              newel = new Mystruct;
//              newel->value = std::min(iterator[j]->value,matrix2[k][i]);
//              for (std::map<unsigned int,bool>::iterator it=iterator[j]->Map.begin(); it!=iterator[j]->Map.end(); ++it)
//              {
//              //newel->Map = iterator[j]->Map;
//                  newel->Map[it->first] = 1;
//              }
//               newel->Map[k] = 1;
//               this->check();


//           }



//        }
//        iterator = result;
//        result.clear();
//    }
//    std::cout<<"Result vector:"<<std::endl;
//    QString resultbuf;
//    for(unsigned int i=0; i<iterator.size();i++)
//    {
//        std::cout<<iterator[i]->value<<": ";
//        resultbuf+=QString::number(iterator[i]->value)+"(";
//        for (std::map<unsigned int,bool>::iterator it=iterator[i]->Map.begin(); it!=iterator[i]->Map.end(); ++it)
//        {
//            std::cout<<it->first<<" "<<it->second<<" ";
//            resultbuf+="x"+QString::number(it->first);
//        }
//        resultbuf+=")v";
//        std::cout<<std::endl;
//       // ui->textBrowser->append();
//    }
//    resultbuf.chop(1);
//    ui->textBrowser->append(resultbuf);

}
void MainWindow::showResult()
{
    std::cout<<"Result vector:"<<std::endl;
    QString resultbuf;
    for(unsigned int i=0; i<iterator.size();i++)
    {
        std::cout<<iterator[i]->value<<": ";
        resultbuf+=QString::number(iterator[i]->value)+"(";
        for (std::map<unsigned int,bool>::iterator it=iterator[i]->Map.begin(); it!=iterator[i]->Map.end(); ++it)
        {
            std::cout<<it->first<<" "<<it->second<<" ";
            resultbuf+="x"+QString::number(it->first+1);
        }
        resultbuf+=")v";
        std::cout<<std::endl;
       // ui->textBrowser->append();
    }
    resultbuf.chop(1);
    ui->textBrowser->append(resultbuf);
}