PAT 1150 Travelling Salesman Problem

旅行商问题

需要判断是否是一条路径,是否是一条简单回路.

可能判断过程有些冗余...

#include <iostream>
#include<vector>
#include <cstring>
#include <climits>
#include <unordered_set>
using namespace std;
int graph[205][205];
int N,M;
int minDis;
int minIndex;
void judge(vector<int>& path,int count){
    int sum=0;
    unordered_set<int> set1;
    for (int i = 0; i < path.size() - 1; ++i) {
        int a=path[i];
        int b=path[i+1];
        if(graph[a][b]==0){
            cout<<"Path "<<count<<": NA (Not a TS cycle)"<<endl;
            return;
        }
        set1.insert(a);
        set1.insert(b);
        sum+=graph[a][b];
    }
    if (set1.size()!=N||path.size()<=N||path[0]!=path[path.size()-1]){//没有访问到所有节点
        cout<<"Path "<<count<<": "<<sum<<" (Not a TS cycle)"<<endl;
        return;
    }
    if(minDis>sum){
        minDis=sum;
        minIndex=count;
    }
    if(path.size()!=N+1){
        cout<<"Path "<<count<<": "<<sum<<" (TS cycle)"<<endl;
        return;
    }
    cout<<"Path "<<count<<": "<<sum<<" (TS simple cycle)"<<endl;
}
int main() {
//    std::cout << "Hello, World!" << std::endl;
//    int N,M;
    cin>>N>>M;
    minDis=INT_MAX;
    memset(graph,0, sizeof(graph));
    for (int i = 0; i < M; ++i) {
        int a,b,val;
        cin>>a>>b>>val;
        graph[a][b]=val;
        graph[b][a]=val;
    }
    int K;
    cin>>K;
    vector<vector<int> > vectors;
    for (int j = 0; j < K; ++j) {
        int num;
        cin>>num;
        vector<int> vector1;
        for (int i = 0; i < num; ++i) {
            int val;
            cin>>val;
            vector1.push_back(val);
        }
        vectors.push_back(vector1);
    }
    for (int i = 0; i < vectors.size(); ++i) {
        judge(vectors[i],i+1);
    }
    cout<<"Shortest Dist("<<minIndex<<") = "<<minDis<<endl;
    return 0;
}