数据结构强化阶段（题目：图相关）

Posted 2023-02-22 晨沉宸辰

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, m;
int h[N], e[N], ne[N], idx;
int d[N]; //表示距离
queue<int> vis;
void add(int a, int b)

    e[idx] = b, ne[idx] = h[a], h[a] = idx++;

int bfs()

    memset(d, -1, sizeof(d)); //距离初始化-1
    d[1] = 0;
    vis.push(1); //1号节点进队
    while (!vis.empty())
    
        int t = vis.front();
        vis.pop();
        for (int i = h[t]; i != -1; i = ne[i]) //扩展一层
        
            int j = e[i];
            if (d[j] == -1) //表示这个点没被遍历到过
            
                d[j] = d[t] + 1;
                vis.push(j);
            
        
    
    return d[n];

int main()

    cin >> n >> m;
    memset(h, -1, sizeof(h));
    for (int i = 0; i < m; i++)
    
        int a, b;
        cin >> a >> b;
        add(a, b);
    
    cout << bfs() << endl;
    return 0;