Hello! Can someone please help with this problem: I have to show the depth first search for a tree with the information below. the numbers and variables correspond to the edges and their designated weight. so thus, m must be the lowest value and r the highest. This makes sense till the end, where m-n is 5 and n-o is 5 as well, 5 is not < 5 but = ? help?
prove: m<n<o<p<q<r… The path i have at the moment is
[FONT=MathJax_Math]r[/FONT][FONT=MathJax_Main]→[/FONT][FONT=MathJax_Math]q[/FONT][FONT=MathJax_Main]→[/FONT][FONT=MathJax_Math]p[/FONT][FONT=MathJax_Main]→[/FONT][FONT=MathJax_Math]o[/FONT][FONT=MathJax_Main]→[/FONT][FONT=MathJax_Math]n[/FONT][FONT=MathJax_Main]→[/FONT][FONT=MathJax_Math]m
[/FONT]
m→n 5,
n→o 5,
m→o 1,
o→p 6,
p→q 7,
q→r 8,
q→o 12…
prove: m<n<o<p<q<r… The path i have at the moment is
[FONT=MathJax_Math]r[/FONT][FONT=MathJax_Main]→[/FONT][FONT=MathJax_Math]q[/FONT][FONT=MathJax_Main]→[/FONT][FONT=MathJax_Math]p[/FONT][FONT=MathJax_Main]→[/FONT][FONT=MathJax_Math]o[/FONT][FONT=MathJax_Main]→[/FONT][FONT=MathJax_Math]n[/FONT][FONT=MathJax_Main]→[/FONT][FONT=MathJax_Math]m
[/FONT]
m→n 5,
n→o 5,
m→o 1,
o→p 6,
p→q 7,
q→r 8,
q→o 12…
Last edited: