DSL: automatic derivation of greedy algorithm and dynamic programming
-
Updated
Oct 9, 2017 - Haskell
DSL: automatic derivation of greedy algorithm and dynamic programming
Greedy solution for multiset data structures
Implemented MST (Minimum Spanning Tree) for a weighted, undirected graph using Prim’s algorithm. The program uses an 'adjacency list' and 'edge matrix' to support various commands and manipulations. These include: calculating MST value, finding the degree of a vertex, inserting/deleting edges, etc.
Team Veni Vidi Vsync's submission for the Google Hash Code 2017 Online Qualification Round.
Maximum independent set problem - greedy and brute force parallel algorithms
Compression utility
Solving the Travelling Salesman Problem using different types of algorithms.
Greedy Money is a Python tool to decompose a large number in smaller fixed ones.
🔲 Trabalho Prático 2 - AEDs III
Implementation and solutions of Algorithm Paradigms , Dynamic Programming, Divide and Conquer, Backtrack and Greedy Algorithms,
Add a description, image, and links to the greedy-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the greedy-algorithm topic, visit your repo's landing page and select "manage topics."