AppliedNumeric answer
A graph has edges A–B (weight ), B–C (), A–C (), C–D () and B–D (). What is the total weight of its minimum spanning tree?
Answer with a number. Fractions, powers and expressions like 23/6 or C(52,5) are read correctly in practice.
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Learn the method
Reported in interviews at
More data structures and algorithms questions
- What is the maximum number of edges in a directed acyclic graph on ten vertices?Foundation
- A dependency graph has edges a → b, a → c, b → d, c → d.Foundation
- Converting between currencies, part 1 of 3Foundation
- Your shortest-path graph has some negative edge weights but no negative cycles.Applied
- What is the running time of Dijkstra’s algorithm with a binary heap, on a graph…Applied
- Converting between currencies, part 2 of 3Applied