So we have that assignement in one of my uni classes:
we have a list of nodes and of edges that connects them (short path graph problem).
Every node has an amount of objects A, B and C.
the question is to find x objects A, y objects B and z objects C by going through the nodes
and to come back to initial node.
We are basically looking for the shortest path to get all of the 3 types of objects.
Seems like an NP problem to me and I am unsure about the optimal solution.
What do you guys think? Any ideas on how to solve the question?
Note: we have a rather small amount of nodes (in exemple 20 nodes are given in the graph, but can be N nodes in theory)
Note2: Djikstra algorithm is encouraged but not a constraint