UNIT IV GREEDY TECHNIQUE Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem
| dc.contributor.author | . | |
| dc.date.accessioned | 2022-02-23T09:45:29Z | |
| dc.date.available | 2022-02-23T09:45:29Z | |
| dc.date.issued | 2019 | |
| dc.identifier.uri | http://10.10.11.6/handle/1/5030 | |
| dc.language.iso | en | en_US |
| dc.publisher | GALGOTIAS UNIVERSITY | en_US |
| dc.subject | Design and Analysis of Algorithms | en_US |
| dc.title | UNIT IV GREEDY TECHNIQUE Greedy Technique – Minimum Spanning Tree – Prim‘s Algorithm – Kruskal’s Algorithm – Single source-shortest-paths Problem – Dijkstra’s Algorithm – Huffman Coding – Fractional Knapsack Problem | en_US |