Skip to content

Latest commit

 

History

History
29 lines (22 loc) · 1.07 KB

README.md

File metadata and controls

29 lines (22 loc) · 1.07 KB
Raw

Kruskal Algorithm - Minimum Spanning Tree

Details: Kruskal Algorithm in C# and Portugol for College Activity.
Subject: Graph Theory.

The PDF attached is my handwritten guide about MST.

All codes commentaries are in PT-BR

Pre-Requistes:

  • Study about the Kruskal Algorithm;
  • Create a Pseudo-Code; (I choose to create in Portugol - A PT-BR Pseudo-Code Language)
  • Implement the Code in C Language;

How To Use:

Inputs:

1st input: The edge quantity in the graph - You don't need to put the vertices; (Min. of 5 and Max. of 15)
2nd input: Loop between 0 and the quantity you inserted;

Outputs:

1st output: The new edges - After removing Cicles and Paralels;
2nd output: Details of the operation - More for testing purposes like which edges the program took off;
3rd output: Final graph node;
4th output: Minimal Cost;

Known-Bugs:

V1.0 - No Cycle Break;
V1.1 - Issue on Cycles with more than 3 connections;
V1.2 - Glitches with a few cases (Mostly on connections between the last and the first node);