用到的数据结构
struct eage{ll v,w,ne;};//存储终点,权值,下一条边的下标
ll idx,n,m;//边集的下标,n的点,m条边
vector<eage> e(N);//边集
vector<ll> h(N,-1);//存储最后一个输入的边
#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 v,w,ne;};//存储终点,权值,下一条边的下标
ll idx,n,m;//边集的下标,n的点,m条边
vector<eage> e(N);//边集
vector<ll> h(N,-1);//存储最后一个输入的边
void add(ll u,ll v,ll w)
{
e[idx] = {v,w,h[u]};//下一个点,权值,上一条同起点的边l的编号
h[u] = idx ++;//存储最后一个输入的边
}
void dfs(ll u,ll fa)
{
for(int i = h[u]; ~ i; i = e[i].ne)
{
ll v = e[i].v, w = e[i].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);
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
//out
//1 5 20
//5 2 70
//5 6 60
//1 4 30
//4 3 90