西南交通大学算法与设计实验1.3

注：对于算法与设计实验仅提供代码，不提供流程图等其他内容

---

2023.3.15更新：重新定义输入模式，增加对有环图的检查。

#include <iostream>
#include <stack>
#include <vector>

using namespace std;

// Node结构体
typedef struct Node{
    unsigned char Name{};
    bool is_visited = false;
    vector<Node*> sons;
}Node;

// 临时栈和拓扑排序栈
stack<Node*> temp_stack;
stack<Node*> top_stack;

//拓扑排序函数
void TopSort(Node* node) {
    if (node->is_visited) {
        return;
    }
    temp_stack.push(node);
    for (auto &i : node->sons) {
        TopSort(i);
    }
    node->is_visited = true;
    top_stack.push(temp_stack.top());
    temp_stack.pop();
}

// 检查是否有环函数
bool check(Node* node) {
    if (node->is_visited) {
        return true;
    }
    if (!node->sons.empty()) {
        node->is_visited = true;
        for (auto &i : node->sons) {
            if (check(i)) {
                return true;
            }
        }
    } else {
        return false;
    }
}

int main() {
    vector<Node*> all_nodes;
    //输入节点数和边数
    int node_num, edge_num;
    //输入对应的边即可
    cin >> node_num >> edge_num;
    Node *n1, *n2;
    int counter = 0;
    // 输入
    while (all_nodes.size() != node_num || counter != edge_num) {
        counter++;
        n1 = new Node;
        n2 = new Node;
        cin >> n1->Name >> n2->Name;
        bool n1_find = false;
        bool n2_find = false;
        for (auto i : all_nodes) {
            if (i->Name == n1->Name) {
                n1_find = true;
                n1 = i;
            }
            if (i->Name == n2->Name) {
                n2_find = true;
                n2 = i;
            }
        }
        n1->sons.push_back(n2);
        if (!n1_find) {
            all_nodes.push_back(n1);
        }
        if (!n2_find) {
            all_nodes.push_back(n2);
        }
    }
    //检查是否有环
    for (int i = 0; i < all_nodes.size(); ++i) {
        if (!all_nodes[i]->sons.empty()) {
            if (check(all_nodes[i])) {
                cout << "The input is not a dag" << endl;
                return -1;
            }
        }
        for (int j = 0; j < all_nodes.size(); ++j) {
            all_nodes[j]->is_visited = false;
        }
    }
    //拓扑排序
    for (auto &i : all_nodes) {
        if (!i->is_visited) {
            TopSort(i);
        }
    }
    // 输出序列
    int temp = top_stack.size();
    for (int i = 0; i < temp; i++) {
        cout << top_stack.top()->Name << " ";
        top_stack.pop();
    }
}

---

测试用例：

样例1：
4 4
1 2
2 3
3 4
4 1
样例2：
6 6
1 2
6 2
2 3
2 4
3 5 
4 5

样例输出：