Path finding!

Revision en3, by GrandmomPanties, 2017-05-19 23:14:33

I have a problem and today I want to ask if this question have an answer or not! We have a graph and Jafar and Omidaz are at nodes x and y, each time Kodser destroys an edge and asks is there a path between Omidaz and Jafar or not! If the answer was negative Kodser puts the edge back and it doesn't destroy, at the end Shakheshoon want's to know how many edges are destroyed! nodes < 3e6, questions < 3e6

Tags graphs


  Rev. Lang. By When Δ Comment
en3 English GrandmomPanties 2017-05-19 23:14:33 4 Tiny change: ' how many nodes are des' -> ' how many edges are des'
en2 English GrandmomPanties 2017-05-19 23:13:50 11
en1 English GrandmomPanties 2017-05-19 23:07:08 421 Initial revision (published)