Hello ! I have come across a graph problem which has n(<=16) nodes (And It is connected) and we need to find the MAX NUMBER of nodes on any possible path (Path should not contain cycles) between any two pair of nodes in the graph . How can I solve it ? Can anybody suggest any idea ?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3904 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3494 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | maroonrk | 3350 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 159 |
| 5 | awoo | 157 |
| 5 | adamant | 157 |
| 7 | -is-this-fft- | 156 |
| 8 | nor | 154 |
| 9 | TheScrasse | 153 |
| 10 | Dominater069 | 152 |
→ Find user
→ Recent actions
Comments (0)
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/25/2024 20:31:35 (i1).
Desktop version, switch to mobile version.
Supported by
