https://github.com/zettca/ist.asa.graphs4

Minimum Spanning Tree problem solved with Kruskal's Algorithm in C++
https://github.com/zettca/ist.asa.graphs4

algorithm graphs kruskal kruskal-algorithm school

Last synced: 4 days ago
JSON representation

Minimum Spanning Tree problem solved with Kruskal's Algorithm in C++

• Host: GitHub
• URL: https://github.com/zettca/ist.asa.graphs4
• Owner: zettca
• Created: 2017-04-30T23:30:08.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2017-05-01T21:48:37.000Z (over 7 years ago)
• Last Synced: 2024-11-14T12:19:43.904Z (2 months ago)
• Topics: algorithm, graphs, kruskal, kruskal-algorithm, school
• Language: C++
• Size: 591 KB
• Stars: 0
• Watchers: 0
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# ist.asa.graphs4

A C++ implementation for a Minimum Spamming Tree (MST) problem using [Kruskal's Algorithm](https://en.wikipedia.org/wiki/Kruskal%27s_algorithm).

### Project Infos

* **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

### Disclaimer

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.