Is there a way to find the diameter of an undirected connected graph if I am removing some nodes from the graph?
I know I can run BFS every time I remove a node, but can I do better?
Is there a way to find the diameter of an undirected connected graph if I am removing some nodes from the graph?
I know I can run BFS every time I remove a node, but can I do better?