Problem : You have to delivery some coins from one city to another city. There are $10$ types of coin with some number and weight of each coin. You have to use fractional knapsack algorithm to find the maximum value of coins and use Dijkstra's Algorithm to find the path from the given graph.

Condition :

Each type of coin, there are some number such as T$1$ coin has $15$ coins. When do fractional knapsack, you may end up with T$1=4\mathrm{.}75$ coins. You have to floor $4\mathrm{.}75$ to $4$ coins.

What to do :

Solve the knapsack manually with explanation in PDF or Word.

Solve Dijkstra's Algorithm manually with explanation in PDF or Word.

Write program to solve the problem by select one city as start city and one city as goal city. Show the solution of how many type of coin and its number with the maximum value. Show the path from start to goal.

Combine the first part and the source code with solution into PDF or Word. Also, Source code file.

Due date : October $13,2024$

Information :

$\backslash$table$[[$Coin Type,$\backslash$table$[[$Value per$],[$coin vi$]],\backslash$table$[[$Weight per$],[$coin wi$]],$Coins Available$],[1,4,2,10],[2,14,3,4],[3,8,4,5],[4,6,2,10],[5,7,5,8],[6,9,6,15],[7,15,3,5],[8,12,8,3],[9,10,7,5],[10,8,6,6]]$

Capacity : $85$ Gram

DTI$212$ FINAL EXAM