KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
We know there is "Union and find" for disjoint sets. http://en.wikipedia.org/wiki/Union_find But how to do reverse operation ? Consider a set with N nodes connected with E edges( which is in fact a graph ). And at each step we want to delete some edge and check if this delete operation leads to have another disjoint set. Is it possible to do it fastly like in "Union and find"? P.S this is not homework, we have holiday :)
Tags (comma-separated)
Save Edits
Cancel