← Oracle questions

Minimum Spanning Tree Algorithms Comparison

Filed under Oracle

Given an undirected, connected, weighted graph with n nodes (0 to n-1) and a list of edges [u, v, weight], write code to find the total weight of the Minimum Spanning Tree (MST) using Prim's…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Oracle questions

Collected from public candidate posts and coding forums. Updated Nov 2026.