Given a fully connected undirected graph, is there a quick way for me to know if the graph will remain fully connected if I delete a given edge from the graph?
Quick = O(lg V) or something like that. O(V) is not quick.
Fully connected = every node is reachable from every other other node in the graph. i.e., given any two nodes in the graph, there is always a path connecting these two nodes.