A full-stack inventory management system built with Flask and MongoDB.
-
Updated
Jun 15, 2025 - HTML
#
krushkal-algorithm
Here are 5 public repositories matching this topic...
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…
-
Updated
Apr 30, 2021 - C
This is implementation of Krushkal and Prim's Algorithm to find Minimum Spanning tree with the help of self implemented Fibonacci Heap and Disjoint Set
-
Updated
Nov 11, 2025 - C++
A Python Tkinter-based tool to visualize graph algorithms (BFS, DFS, Dijkstra, Prim’s, Bellman-Ford, Floyd-Warshall) with animations.
python algorithms astar-algorithm pathfinding a dfs tkinter graph-visualization bfs dijkstra-algorithm prims-algorithm bellman-ford floyd-warshall-algorithm krushkal-algorithm
-
Updated
Nov 16, 2025 - Python
Different Algorithms implemented using CPP
linked-list cpp recursion sorting-algorithms problem-solving searching-algorithms greedy-algorithms coding-challenge graphs-algorithms krushkal-algorithm
-
Updated
Jan 31, 2022 - C++
Improve this page
Add a description, image, and links to the krushkal-algorithm topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the krushkal-algorithm topic, visit your repo's landing page and select "manage topics."