Hi all! I was solving this problem:- We are given a weighted directed graph. We have to find the route with minimum length and it should visit all the nodes with a node not visited more than once. Please help in tackling it!! Thanks for reading it.
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3880 |
| 2 | jiangly | 3669 |
| 3 | ecnerwala | 3654 |
| 4 | Benq | 3627 |
| 5 | orzdevinwang | 3612 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | jqdai0815 | 3532 |
| 9 | Radewoosh | 3522 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | maroonrk | 153 |
| 5 | atcoder_official | 149 |
| 6 | -is-this-fft- | 148 |
| 6 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | nor | 144 |
| 10 | cry | 143 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 28.07.2024 13:23:24 (i2).
Десктопная версия, переключиться на мобильную.
При поддержке
Hi, can you please provide the problem link if available? I'm interested about the constraints of the number of nodes, edges etc.
Thanks
Actually, there is still no polynomial algorithm for this problem. The only way to solve it is using backtracking.
What is a "cyclic graph"? This term is rarely used in programming tasks, so maybe you meant acyclic graph?