Hey..! I have a question at the following exercise.
<<We have a set of \(\displaystyle N\) objects, denoted \(\displaystyle 1,2,...,N\), which we want to group in clusters that consist of consecutive objects. For each cluster \(\displaystyle i,i+1,...,j\), there is an associated cost \(\displaystyle a_{ij}\). We want to find a grouping of the objects in clusters such that the total cost is minimum. Formulate the problem as a shortest path problem, and write a DP algorithm for its solution.>>
Could you tell me what I have to do to formulate the problem as a shortest path problem??
<<We have a set of \(\displaystyle N\) objects, denoted \(\displaystyle 1,2,...,N\), which we want to group in clusters that consist of consecutive objects. For each cluster \(\displaystyle i,i+1,...,j\), there is an associated cost \(\displaystyle a_{ij}\). We want to find a grouping of the objects in clusters such that the total cost is minimum. Formulate the problem as a shortest path problem, and write a DP algorithm for its solution.>>
Could you tell me what I have to do to formulate the problem as a shortest path problem??