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?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
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. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
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) |
Name |
---|