🚀 Data Structures & Algorithms (DSA) concepts: 🔍 Complexity analysis 🧩 Problem-solving techniques 🖥️ Programming paradigms
-
Updated
Mar 2, 2025 - C
🚀 Data Structures & Algorithms (DSA) concepts: 🔍 Complexity analysis 🧩 Problem-solving techniques 🖥️ Programming paradigms
Programs covered in DAA Lab during Semester 4
MST/maze generation by Kruskal's, Prim's and Boruvka's algorithm in C
Dijkstra's algorithm, minimum spanning trees, DFS
Important Codes in C for Lab Evaluations
This project developed along the discipline of "Algorithms and Data Structures" at UFMG uses an implementation of the Krushkal algorithm to calculate the Minimum Spanning Tree of a graph. The file "entrada.txt" must contain the nodes and edges of the graph as follows: - The first line must contain the number of nodes and the number of edges of t…
The problem statement is regarding a Global Airports Management System.The different airports are connected to each other by means of edges. These form a graph where the airports are the nodes and the edges between the airports represent the connections. Different problems have been posed, regarding graph traversal, sorting, DFS, and MST. Soluti…
Add a description, image, and links to the minimum-spanning-trees topic page so that developers can more easily learn about it.
To associate your repository with the minimum-spanning-trees topic, visit your repo's landing page and select "manage topics."