A C++ implementation for a Minimum Spamming Tree (MST) problem using Kruskal's Algorithm.
- Date: Semester 2 - 2016/2017 (April 2017)
- Topic: Tetromino optimal positioning on a Tetris grid
- Course: Análise e Síntese de Algoritmos (ASA) | Analysis and Synthesis of Algorithms
- Course Link: https://fenix.tecnico.ulisboa.pt/disciplinas/ASA10111326/2016-2017/2-semestre
This repository, and every other ist.COURSE.* repos on GitHub correspond to school projects from the respective COURSE. The code on this repo is intended for educational purposes. I do not take any responsibility, liability or whateverity over any code faults, inconsistency or anything else. If you intend on copying most or parts of the code for your school projects, keep in mind that this repo is public, and that your professor might search the web for similar project solutions or whatnot and choose to fail you for copying.