I want to find an algorithm to find the shortest path in a colored vertex-weighted graph. Every vertex with the same color has the same weight and the total weight of a path
