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?
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 153 |
| 2 | nik_exists | 151 |
| 3 | maroonrk | 150 |
| 4 | maspy | 149 |
| 5 | AmShZ | 146 |
| 6 | Um_nik | 143 |
| 7 | Errichto | 139 |
| 8 | adamant | 135 |
| 9 | BledDest | 134 |
| 10 | cry | 130 |
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. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| 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) |
| Название |
|---|


