Hello I am solving this problem . I am confused on how to fill up the graph so that I can implement shortest path using bfs.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | maroonrk | 154 |
5 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 144 |
Hello I am solving this problem . I am confused on how to fill up the graph so that I can implement shortest path using bfs.
Название |
---|
For every number from 1 to MAXM * 2 , you can push i * 2 and i — 1 in its adjacency list and after doing that , start a bfs from n and print distance[m]. Code -> 10110821
bfs