By yusijia

Updated:

Contents 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48

#include <cstdio>
#include <vector>
#include <iostream>
using namespace std;

const int MAXN = 1000;
int n, m;

struct EdgeNode{//领接表节点
    int to;     //终点
    int w;      //权值
};

vector<EdgeNode> adjlist[MAXN];//下标作为起点

void input()
{
    cin >> n >> m;
    int from, to, w;
    EdgeNode e;
    for(int i = 0; i < m; i++)
    {
        cin >> from >> to >> w;
        e.to = to;
        e.w = w;
        adjlist[from].push_back(e);
    }
}
void bianli()
{
    for(int i = 1; i <= n; i++)
    {
        for(vector<EdgeNode>::iterator k = adjlist[i].begin(); k != adjlist[i].end(); k++)
        {
            EdgeNode t = *k;
            cout << i << "->" << t.to << ' ' << t.w << endl;
        }
    }
}

int main()
{
    freopen("input.txt", "r", stdin);
    input();
    bianli();
    return 0;
}
Contents