Check if Removing an edge split the strongly connected component

I have a strongly connected component of n vertexes. Let n1->n2 be an edge between two vertexes n1 and n2 in this scc. Is there an efficient algorithm to check if removing the edge n1->n2 split the scc into two sccs or not. The graph i am using is a directed graph.