Answer to Question #23186 in Quantitative Methods for Sujata Roy
Which of the following problems can be solved by a standard greedy algorithm?
I. Finding a minimum spanning tree in an undirected graph with positive-integer edge weights
II. Finding a maximum clique in an undirected graph
III. Finding a maximum flow from a source node to a sink node in a directed graph with positive-integer edge
(A) I only (B) II only (C) III only (D) I and II only (E) I, II, and III