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 | tourist | 3947 |
2 | ecnerwala | 3654 |
3 | jiangly | 3627 |
4 | jqdai0815 | 3621 |
5 | orzdevinwang | 3612 |
6 | Benq | 3587 |
7 | Radewoosh | 3582 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3474 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
4 | atcoder_official | 153 |
6 | -is-this-fft- | 148 |
6 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 145 |
10 | cry | 144 |
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) |
Название |
---|