Difference between revisions of "Talk:TADM2E 5.13"
From Algorithm Wiki
(solution is wrong) |
|||
| Line 1: | Line 1: | ||
I think the answer for the third case does not work since in a weighted graph it might not be optimal to choose alternating nodes: 100 - 1 - 1 - 100 (a path with4 nodes, high weights on the leaves, low weights on the inner nodes). | I think the answer for the third case does not work since in a weighted graph it might not be optimal to choose alternating nodes: 100 - 1 - 1 - 100 (a path with4 nodes, high weights on the leaves, low weights on the inner nodes). | ||
| − | |||
| − | |||
| − | |||
| − | |||
Revision as of 12:44, 13 September 2019
I think the answer for the third case does not work since in a weighted graph it might not be optimal to choose alternating nodes: 100 - 1 - 1 - 100 (a path with4 nodes, high weights on the leaves, low weights on the inner nodes).
