This Blog is devoted to the Algorithm 2500 section thought by Dr. Simone Silvestri at the Missouri University of Science and Technology.
Students are welcome to ask questions to the instructor as well as to discuss with other students regarding the assignments and the course in general.
Tuesday 1 September 2015
Homeworks
In this post students can discuss and ask question regarding homeworks.
I have a question about HW #6 with the problem that starts out as "Given a graph G which is a forest with K trees." I'm not sure if this problem is referring to the graph G that was used in previous problems, or to a undefined graph. If its referencing the G used in the previous example am I correct in assuming the answer should be a finite number?
I have a question about HW #6 with the problem that starts out as "Given a graph G which is a forest with K trees." I'm not sure if this problem is referring to the graph G that was used in previous problems, or to a undefined graph. If its referencing the G used in the previous example am I correct in assuming the answer should be a finite number?
ReplyDeleteThe question is independent from the rest. It asks for a generic graph G which is a forest composed by K trees.
Delete