複選題(46)Which of the followings is correct? (A) The optimal path has the so called optimal substructure. (B) The optimal path between two vertices is unique. (C) The problem can be solved with a greedy algorithm. (D) The problem can be solved with dynamic programming. (E) The Floyd-Warshall algorithm is the most efficient method for this problem.