Given two undirected unweighted graphs, you need to connect two nodes from each graph, so that minimal maximum distance between any two nodes will be minimal, answer is such distance. I am stuck on this, any suggestions ?
Given two undirected unweighted graphs, you need to connect two nodes from each graph, so that minimal maximum distance between any two nodes will be minimal, answer is such distance. I am stuck on this, any suggestions ?
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | maspy | 150 |
| 3 | nik_exists | 145 |
| 3 | Um_nik | 145 |
| 5 | Errichto | 139 |
| 6 | adamant | 136 |
| 7 | maroonrk | 134 |
| 8 | DNR | 132 |
| 9 | AmShZ | 131 |
| 10 | Dominater069 | 129 |
