Knapsack Problem Using Greedy Approach

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.

Algorithmia: Backtracking, Prefix Sums problems, Multiple Knapsack problem (Dinamyc programing). Adapted BFS, Kruskal, Dijkstra implementations. Heuristics, Greedy algorithms, k-opt search.

Implementation of Greedy algorithm

Job scheduling : Greedy Algorithm versus Brute Force Algorithm. Comparison of time of complexities.

Maximum independent set problem - greedy and brute force parallel algorithms

An efficient graph coloring code in C/C++

Code used in the paper "Next-Best-Smell: a multi-criteria robotic exploration strategy for Radio Frequency Identification tags discovery"

Rozwiazanie optymalizacji problemu plecaka przy użyciu algorytmu zachłannego i FPTAS

Collection of problems based on Greedy Algorithm.

File compressor using huffman encoding

The program searches the path from one point to another on a 100/100 map. It uses a greedy algorithm that compares the average times it takes to pass given fields around. He chooses a square that is easiest to travel to and counts the time to leave the current square and enter the next one. The program shows the path that must be followed to rea…

My Solutions of (Algorithmic-Toolbox ) Assignments from Coursera.

(Class) Heuristic Optimization Methods

Solving a cars assembly line NP problem by implementing three algorithmic approaches: an exhaustive search, a greedy algorithm and a metaheuristic. 🚗

This repository consists of the data-structures and algorithms, I implemented for the lab course CSE204: Data Structures and Algorithm I Sessional.