C/C++ Qt實現文章小說人物關系分析

#include "QtGuiApplication1.h"
 
#include<qDebug>
#include<QFile>
 
#include <fstream> 
#include<iostream>
using namespace std;
 
#include <sstream>
#include <unordered_map>

//讀取人物名稱
void QtGuiApplication1::readOnButton()
{
    //打開關鍵詞文件
    ifstream ifs;
    ifs.open("name.txt", ios::in);
    if (!ifs.is_open())
    {
        cout << "打開文件失敗" << endl;
        return;
    }
 
    //一行一行讀取到數組中
    string buf;
    while (getline(ifs, buf))
    {
        cout << buf << endl;
        QString name = QString::buf);
        gNameList << name; 
    }
    ifs.close();
 
    ui.textEdit->setPlainText(gNameList);
 
}
 
//出現次數
void QtGuiApplication1::timesOnButton()
{
    qDebug() << QString::fromLocal8Bit("人名次數統計");
 
    //統計歸零
    if (gNameList.size() == 0)
    {
        std::cout << "請倒入人名列表後再試！" << std::endl;
    }
 
    gNameCounter.clear();
 
    for (auto name : gNameList)
    {
        std::string key = name.toLocal8Bit();
        gNameCounter[key] = 0;
    }
 
    //一行行讀入小說
    ifstream ifs;
    ifs.open("天龍八部.txt", ios::in);
    if (!ifs.is_open())
    {
        cout << "打開文件失敗" << endl;
        return;
    }
 
    //清空統計用的TABLE的數據
    gTable.clear();
 
    //統計結果顯示到界面
    QStringList result;
    for (auto name : gNameList)
    {
        std::string keyword = name.toLocal8Bit();
        QString tmp = name + ":" + QString::number(gNameCounter[keyword]);
        result << tmp;
 
        std::cout << keyword << " " << gNameCounter[keyword] << std::endl;
 
    }
    ui.textEdit_3->setText(result.join("\n"));
}
 
//篇幅跨度
void QtGuiApplication1::rangeOnButton()
{
    ui.textEdit_3->clear();
    for (auto name : gNameList)
    {
        std::string keyword = name.toLocal8Bit();
 
        int firstLineNum = -1;
        int lastLineNum = -1;
        for (int i = 0; i < gTable.size(); i++)
        {
            auto& row = gTable.at(i);
            //std::cout << "行號:" << i << " ";
 
            int KeyWordCounts = row[keyword];
            if (KeyWordCounts > 0)
            {
                if (firstLineNum == -1)
                {
                    firstLineNum = i;
                }
 
                lastLineNum = i;
            }
        }
 
 
        ui.textEdit_3->append(QString::number(lastLineNum - firstLineNum));
    }
}
 
//關系最緊密兩人
void QtGuiApplication1::relationGoodOnButton()
{
    ui.textEdit_3->clear();
    qDebug() << "test";
 
    //關系緊密算法，原理每個人名在第幾行出現的行數集合和另一個人名行數集合求距離，取最小值為它的精密度
    //值越小的那個為此人和另一個人的最精密度，然後同樣的方法計算出此人與其它人的精密度，最終取得
    //誰和這個人最緊密
 
    std::map < std::string, std::vector<int>> DataContainer;
    //正在對比的兩個選手
    std::string player1, player2;
    int theMinDistance = 9999999999999999;
    for (auto name : gNameList)
    {
        std::string keyword = name.toLocal8Bit();
        std::vector<int> rowNums;
 
        for (int i = 0; i < gTable.size(); i++)
        {
            auto& row = gTable.at(i);
            //std::cout << "行號:" << i << " ";
            int KeyWordCounts = row[keyword];
            if (KeyWordCounts > 0)
            {
                rowNums.push_back(i);
            }
        }
        DataContainer[keyword] = rowNums;
    }
 
 
 
    ui.textEdit_3->append(QString::number(theMinDistance)+ QStringLiteral("行"));
 
}