Breadth First Search
Maximum by minimum
An oriented unweighted graph is given. Find in it a vertex, the shortest distance from which to the given one is maximum, and print this distance.
First line contains three positive integers n, m и s (1 ≤ s ≤ n ≤ 5000, 1 ≤ m ≤ 20000) - the number of vertices and edges in the graph and the number of given vertex. In the next m lines the graph edges are given. Each edge is given with the pair of numbers - the starting and the ending point.
Print one integer - the required shortest distance.
3 5 3 1 2 2 1 3 1 2 3 3 3