图的存储和访问----链式领接表（2个版本）

 1.利用vis数组判断是否走过这个点

struct eage{ll u,v,w;};//存储起点，终点，边权
bool vis[N];//判断是否走过
vector<eage> e;//边集数组
vector<ll> h[N];//存储该节点出点所对应的边对应于边集数组的下标
ll n,m;//n个点，m条边

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> PII;
#define pb emplace_back
//#define int ll
#define all(a) a.begin(),a.end()
#define x first
#define y second
#define ps push_back
#define endl '\n'
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)

void solve();

const int N = 1e6 + 10;

signed main() {
    IOS;
    solve();
    return 0;
}

struct eage{ll u,v,w;};//存储起点，终点，边权
bool vis[N];//判断是否走过
vector<eage> e;//边集数组
vector<ll> h[N];//存储该节点出点所对应的边对应于边集数组的下标
ll n,m;//n个点，m条边

void add(ll u,ll v,ll w)
{
    e.push_back({u,v,w});
    h[u].pb(e.size() - 1);
}

void dfs(ll u)
{
    vis[u] = 1;
    for(auto it : h[u])
    {
        ll v = e[it].v , w = e[it].w;

        if(vis[v]) continue;cout << u << ' ' << v << ' ' << w << endl;
        dfs(v);
    }
}


void solve() {
    cin >> n >> m;
    for(int i = 1; i <= m; ++ i)
    {
        ll u,v,w;
        cin >> u >> v >> w;
        add(u,v,w);
        add(v,u,w);
    }
    dfs(1);
}

//输入
//7 6
//4 3 90
//1 4 30
//5 7 80
//5 6 60
//1 5 20
//5 2 70

//输出
//1 4 30
//4 3 90
//1 5 20
//5 7 80
//5 6 60
//5 2 70

2.利用dfs（u，fa）判断是否往回走了

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> PII;
#define pb emplace_back
//#define int ll
#define all(a) a.begin(),a.end()
#define x first
#define y second
#define ps push_back
#define endl '\n'
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)

void solve();

const int N = 1e6 + 10;


signed main() {
    IOS;
    solve();
    return 0;
}

struct eage{ll u,v,w;};//起点，终点，边权
vector<ll> h[N];//下标对应的出边l，l在边集中的下标
vector<eage> e;//边集
ll n,m;

void add(ll u,ll v,ll w)
{
    e.push_back({u,v,w});
    h[u].ps(e.size()-1);
}

void dfs(ll u,ll fa)
{
    for(auto it : h[u])
    {
        ll v = e[it].v, w = e[it].w;
        if(v == fa) continue;
        cout << u << ' ' << v << ' ' << w << endl;
        dfs(v,u);
    }
}

void solve() {
    cin >> n >> m;
    for(int i = 1; i <= m; ++ i)
    {
        ll u,v,w;
        cin >> u >> v >> w;
        add(u,v,w);
        add(v,u,w);
    }
    dfs(1,0);//根结点，根节点的父节点
}

//输入
//6 5
//4 3 90
//1 4 30
//5 6 60
//1 5 20
//5 2 70

//输出
//1 4 30
//4 3 90
//1 5 20
//5 6 60
//5 2 70