Flipkart Warehouse Minimum Spanning Network
Flipkart Warehouse Minimum Spanning Network
MediumGraphs100% accepted
Flipkart plans to connect n warehouses with minimum total cable length. Given n nodes and weighted undirected edges, find the minimum spanning tree weight (Kruskal or Prim).
Approach
Minimum spanning tree total weight using Kruskal or Prim algorithm.
Input
4 5
0 1 10
0 2 6
0 3 5
1 3 15
2 3 4
Output
19
More Graphs problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards