We are given a weighted graph with $$$N$$$ vetices and $$$M$$$ edges.
Is there any polynomial way to build spanning tree from original graph so that Mex of values on edges of ST is maximal?
Spanning tree with maximum Mex
We are given a weighted graph with $$$N$$$ vetices and $$$M$$$ edges.
Is there any polynomial way to build spanning tree from original graph so that Mex of values on edges of ST is maximal?
| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3844 |
| 2 | Benq | 3792 |
| 3 | tourist | 3719 |
| 4 | VivaciousAubergine | 3647 |
| 5 | jiangly | 3616 |
| 6 | ksun48 | 3595 |
| 7 | Kevin114514 | 3491 |
| 8 | strapple | 3486 |
| 9 | Um_nik | 3376 |
| 10 | turmax | 3371 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
