![[-]](/~ygleyzer/course.wiki/images/button-minus.gif)
Q 3
by ohado - Monday, 11 May 2009 01:49:18
a solution for the described problem ("HaEtz Ha'adom Beyoter") will be a MST with maximum number of red edges ?
or just a regular spanning tree with maximum number of red edges ?
or just a regular spanning tree with maximum number of red edges ?
Re: Q 3
by algo092 - Monday, 11 May 2009 09:20:19
A solution will be a MST with a maximal number of red edges.
Re: Q 3
by yaelzar - Thursday, 14 May 2009 13:46:53
Is it possible for my tree to have 0 red edges? Can I take for a counter-example such a graph that has red&black edges, and that if any tree of his will take ANY of the red edges the tree will not be an MST?