Min Edge Reversal

You are given a directed graph with vertices labeled from 0 to N-1 and a list of M directed edges. Write a function that computes the minimum number of edge reversals required so that there is at least one path from a given source vertex S to a destination vertex D. If it is not possible to obtain such a path even after reversing some edges, the function should return -1.

Assumptions:

• The input graph may contain cycles.
• Reversing an edge inverts its direction. You cannot add or remove any edges apart from reversing them.
• N (number of vertices) and M (number of edges) can be large, so an efficient solution is required.

Input:

• An integer N representing the number of vertices.
• An integer M representing the number of edges.
• A list of edges where each edge is represented as a pair of integers [u, v] indicating an edge from vertex u to vertex v.
• An integer S representing the source vertex.
• An integer D representing the destination vertex.

Output:

• An integer that represents the minimum number of edge reversals needed to obtain a path from S to D, or -1 if no such path exists.

Example:

Input:
N = 5
M = 6
Edges = [
    [0, 1],
    [2, 1],
    [2, 3],
    [3, 4],
    [4, 2],
    [1, 0]
]
S = 0
D = 3

Output:
1

In the example, reversing the edge [2, 1] to [1, 2] would create a path from vertex 0 to vertex 3: 0 -> 1 -> 2 -> 3.

Design and implement an algorithm that solves the problem as described.