Given an undirected graph with n nodes rooted at node 1. In this graph for each node we've to find the number of predecessors in the path from root to this node. How can I solve this problem?
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
How to solve this coding round problem?
Given an undirected graph with n nodes rooted at node 1. In this graph for each node we've to find the number of predecessors in the path from root to this node. How can I solve this problem?
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en7 |
|
destiny____ | 2021-11-08 20:06:34 | 2 | Tiny change: 'irected **weighted**' -> 'irected **unweighted**' | |
| en6 |
|
destiny____ | 2021-11-08 20:01:55 | 154 | ||
| en5 |
|
destiny____ | 2021-11-08 19:59:22 | 17 | ||
| en4 |
|
destiny____ | 2021-11-08 19:58:45 | 13 | Tiny change: 'rs in the path from root to t' -> 'rs in the shortest path from the root to t' | |
| en3 |
|
destiny____ | 2021-11-08 19:58:12 | 11 | Tiny change: 'let's say graph is ' -> 'let's say the graph is ' | |
| en2 |
|
destiny____ | 2021-11-08 19:57:32 | 222 | ||
| en1 |
|
destiny____ | 2021-11-08 19:54:53 | 230 | Initial revision (published) |
| Название |
|---|


