Uniform Cost Search
In this implementation of the algorithm, can there be multiple path cost values for the same node in the frontier?
What happens if UCS does not keep track of visited nodes?
Let's say that node n is in the frontier with value v. Is v guaranteed to be the shortest path from the start node to n?
Given the following graph, if Uniform-Cost Search is used to find the shortest path from A to E, what will the total cost of the shortest path be? (Graph: A -> B = 3, A -> C = 4, B -> D = 2, C -> D = 5, D -> E = 1, C -> E = 4)
Consider the following graph. A -> B (cost 1), A -> C (cost 2), B -> D (cost 3), C -> D (cost 1). What is the path that UCS will return?