🏰 The Maze Game offers straightforward maze navigation challenges, built with Prim's & DFS Algorithms. Featuring responsive design for easy play on any device, including mobile, with intuitive on-screen controls for movement, it's ideal for quick gaming sessions, providing both casual and challenging experiences!

PRIM algorithm implemented using Python.

Árvores Geradoras Mínimas aplicadas a Agrupamento de Dados

An automated snake game solver using a Hamiltonian cycle generated by Prim's algorithm

⌚ 🧳 ✈️ A project based in High Performance Computing. This project was built using Apache Spark API, Java and Gradle. The scenario of the project was a Cluster-based implementation of the Prim's Algorithm in a Graph representation of a network of routes between several airports and the average departure delays of that routes. The goal of this pr…

Artificial Intelligence course, Computer Science M.Sc., Ben Gurion University of the Negev, 2021

Simple visualization for Minimum Spanning Tree using Prim's and Kruskal's Algorithm

A benchmarking toolkit for comparing Kruskal's and Prim's minimum spanning tree algorithms across various graph configurations, with visualization tools and performance analysis reports.

Interactive Python game involving maze generation with Prim’s, Kruskal’s, DFS, and Random Walk algorithms, with recursive backtracking for maze solving

An implementation for Prim's minimum spanning tree algorithm using heaps

This project leverages real-time data from Ile-de-France Mobilités (IDFM) to provide an efficient metro navigation system for Paris and Bordeaux (using a simplified dataset). It utilizes graph algorithms to calculate shortest paths, visualize the minimum spanning tree of the metro network, and check network connectivity.

Dijkstra, Kruskal, Prim and Traveling salesman algorithms all in one place.

A Python tool for visualizing and interacting with graph algorithms, including MSTs, shortest paths, graph center, independent sets, and vertex covers. Perfect for learning graph theory with an intuitive interface.

implementation of Kruskal's and Prim's algorithms for Minimum Spanning Trees (MST)

Commented python algorithms for network MST and SP (with visualization via networkx)

The use of the PRIM algorithm to find a minimum spanning tree. The program uses the selected database in CSV format and converts it into a graph to find the minimum spanning tree through the Prim's Algorithm. The chosen database needed to be transformable into a connected, weighted, and undirected graph to ensure error-free processing.

⭐🌙🌒 Algoritmos de grafos y estructuras de datos para representarlos.

Prácticas de la asignatura Algoritmia en la UBU 2024/2025. Desde S1 a S8.

Implementation of Prim and Kruskal algorithms using Python.