Browsing Department of Computer Science and Engineering (CSE) by Subject "Minimum Spanning Tree"
Now showing items 1-2 of 2
-
Study on Selected Greedy Algorithms
(United International University, 2018-02-12)We studied some Greedy Algorithms, implemented to observe the in depth functionalities. We used the main idea of Knapsack problem to solve some problems which are inspired by real life applications. Afterwards we thought ... -
Study on Selected Greedy Algorithms
(United International University, 2018-01-31)We studied some Greedy Algorithms, implemented to observe the in depth functionalities. We used the main idea of Knapsack problem to solve some problems which are inspired by real life applications. Afterwards we thought ...