GitHub - oykuyildirim/Greedy-Algorithms: There is a robot for a library.A sample input file is given below. The first 10 rows represent the adjacency matrix. Then, each room’s name is followed by weight and number of pages of books in 5 rooms. Knapsack algorithm is for maximaxing the total number of pages (it can pick total of 5 kilograms of books from 5 rooms )and Prim algorithm is used.

oykuyildirim / Greedy-Algorithms Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

There is a robot for a library.A sample input file is given below. The first 10 rows represent the adjacency matrix. Then, each room’s name is followed by weight and number of pages of books in 5 rooms. Knapsack algorithm is for maximaxing the total number of pages (it can pick total of 5 kilograms of books from 5 rooms )and Prim algorithm is used.