Developed a highly concurrent variation of Borůvka’s algorithm to process large-scale graphs (100,000+ nodes) in parallel. By utilizing atomic variables and thread-safe concurrent priority queues, the implementation minimized thread contention and prevented deadlocks without heavy locking mechanisms, achieving a 59.7% execution speedup over sequential baselines on an 8-core architecture.