啊哈 算法 中 图相关算法

#include <stdio.h>
#include <iostream>

using namespace std;

int book[101], sum, n, e[101][101];

void dfs(int cur) {
    int i;
    std::cout << cur << " ";
    sum++;
    if (sum == n) return;
    for (i = 1; i <= n; i++) {
        if (e[cur][i] == 1 && book[i] == 0) {
            book[i] = 1;
            dfs(i);
        }
    }
    return;
}



int main()
{
    int i = 0, j = 0, m = 0,a =0, b = 0;
    
    m = 5, n = 5;

    if (n == 0 && m == 0) {
        std::cin >> m >> n;
    }

    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
            if (i == j) e[i][j] = 0;
            else e[i][j] = 99999999;
    //==============================        
    e[1][2] = e[2][1] = 1;
    e[1][3] = e[3][1] = 1;
    e[1][5] = e[5][1] = 1;
    e[2][4] = e[4][2] = 1;
    e[3][5] = e[5][3] = 1;
    //==============================
    /*for (i = 1; i <= m; i++) {
        std::cin >> a >> b;
        e[a][b] = 1;
        e[b][a] = 1;
    }*/

    book[1] = 1;
    dfs(1);
    
    system("pause");

    return 0;
}

#include <stdio.h>
#include <iostream>

using namespace std;


int main()
{
    int i = 0, j = 0, n = 0, m = 0, a = 0, b = 0, cur = 0, book[101] = { 0 }, e[101][101];
    int que[10001], head, tail;

    n = 5; m = 5;
    if (n == 0 && m == 0) {
        std::cin >> n >> m;
    }
    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
            if (i == j) e[i][j] = 0;
            else e[i][j] = 99999999;

    //=======================================
    e[1][2] = e[2][1] = 1;
    e[1][3] = e[3][1] = 1;
    e[1][5] = e[5][1] = 1;
    e[2][4] = e[4][2] = 1;
    e[3][5] = e[5][3] = 1;
    //=======================================
    /*for (i = 1; i <= m; i++) {
        std::cin >> a >> b;
        e[a][b] = e[b][a] = 1;
    }*/
    //=======================================

    head = 1; tail = 1;

    que[tail] = 1;
    tail++;
    book[1] = 1;

    while (head < tail) {
        cur = que[head];
        for (i = 1; i <= n; i++) {
            if (e[cur][i] == 1 && book[i] == 0) {
                que[tail] = i;
                tail++;
                book[i] = 1;
            }
            if (tail > n) {
                break;
            }
        }
        head++;
    }

    for (i = 1; i < tail;i++) {
        std::cout << que[i] << " ";
    }
    system("pause");
    return 0;
}

// 333.cpp: 定义控制台应用程序的入口点。
//

#include "stdafx.h"

#include <stdio.h>
#include <iostream>

using namespace std;

int min = 99999999, book[101], n, e[101][101];

void dfs(int cur, int dis) {
    int j;
    if (dis > min) return;
    if (cur == n) {
        if (dis < min) min = dis;
        return;
    }

    for (j = 1; j <= n; j++) {
        if (e[cur][j] != 99999999 && book[j] == 0) {
            book[j] = 1;
            dfs(j, dis + e[cur][j]);
            book[j] = 0;
        }
    }

    return;
}



int main()
{
    int i, j, m = 0, a, b, c;
    n = 5; m = 8;
    if(n == 0 && m == 0)
        std::cin >> n >> m;

    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
            if (i == j) e[i][j] = 0;
            else e[i][j] = 99999999;

    //=====================================
    e[1][2] = 2;
    e[1][5] = 10;
    e[2][3] = 3;
    e[2][5] = 7;
    e[3][1] = 4;
    e[3][4] = 4;
    e[4][5] = 5;
    e[5][3] = 3;

    //======================================
    /*for (i = 1; i <= m; i++) {
        std::cin >> a >> b >> c;
        e[a][b] = c;
    }*/
    //==================================
    book[1] = 1;
    dfs(1, 0);
    std::cout << min << std::endl;


    system("pause");

    return 0;
}