GitHub

akbota2007/Assignment-3-MST-Prim-and-Kruskal-implementation

Minimum Spanning Tree Algorithms - Assignment 3 Implementation and comparison of Prim's and Kruskal's algorithms for finding the Minimum Spanning Tree in weighted undirected graphs. Project Overview ...
IEEE

Online Query Optimization Through an Effective Kruskal's Algorithm

Abstract: Finding the MST of a weighted connected and undirected graph plays a vital role in different applications of the real world such as effective route finding during navigation, faster ...
GitHub

Parallel Minimum Spanning Tree (MST) using Borůvka's Algorithm

This project provides a massively parallel implementation of a Minimum Spanning Tree (MST) graph algorithm using NVIDIA CUDA. The implementation is based on Borůvka's algorithm, which is highly ...
techannouncer

Mastering LeetCode: Comprehensive Python Solutions and Strategies

Getting a handle on LeetCode can feel like a big task, especially when you’re starting out. But with the right approach and tools, it becomes much more manageable. Python, with its clear syntax and ...
IEEE

Simulation System of College Physical Education Teaching Based on Decision Tree Algorithm and Data Mining

Abstract: At present, computer technology has been popularized in physical education PE (Physical education) teaching in universities, and the complexity of PE teaching has been correspondingly ...
Frontiers

Comparative evaluation of fast-learning classification algorithms for urban forest tree species identification using EO-1 hyperion hyperspectral imagery

Introduction: Accurate identification of forest tree species is essential for sustainable forest management, biodiversity assessment, and environmental monitoring. Urban forests, in particular, ...