图中点的层次-图宽搜

// 宽搜可以用来解决最小路径问题
import java.util.*;
class Main{
	// 图的初始化操作
    static int N = 100010;
    static int[] h = new int[N], e = new int[N], ne = new int[N];
    static int idx = 0;
    static int n;
    static int[] d = new int[N];

	// 图的插入操作
    static void insert(int a, int b) {
        e[idx] = b;
        ne[idx] = h[a];
        h[a] = idx ++;
    }
	
	// 宽搜，其实有模板，用队列的方式
    static int bfs() {
        Arrays.fill(d, -1);
        Queue<Integer> queue = new ArrayDeque<>();
        queue.offer(1);
        d[1] = 0;
        while (!queue.isEmpty()) {
            int t = queue.poll();
			
            for (int i = h[t]; i != 0; i = ne[i]) {
                int j = e[i];
              	
                if (d[j] == -1) {
                    d[j] = d[t] + 1;
                    queue.offer(j);
                }
            }

        }
    return d[n];
} 

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);


        n = sc.nextInt();
        int m = sc.nextInt();
        for(int i = 0; i < m; i ++) {
            insert(sc.nextInt(), sc.nextInt());
        }
        System.out.println(bfs());
    }
}