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?
Distance Query On Graph
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?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
Erickde | 2022-03-05 23:32:51 | 8 | Tiny change: 'There is a way to ' -> 'Is there a way to ' | |
| en2 |
|
Erickde | 2022-03-05 23:32:20 | 54 | Tiny change: 'I was solving this problem., and I was wondering if there is a ' -> 'There is a ' | |
| en1 |
|
Erickde | 2022-03-05 23:31:33 | 260 | Initial revision (published) |