Minimum Spanning Tree under 2 constraints instead of just 1
source link: http://codeforces.com/blog/entry/101772
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Each edge — 'i' in the graph has two values associated with it — v1[i] and v2[i].
Let M be one of the possible MST of the graph. Then define A = max(v1[i]'s for all the edges in MST) and B = max(v2[i]'s for all the edges in the MST).
Then for all the possible MSTs of this graph find the minimum value of A + B.
Recommend
-
40
Graph is a non linear data structure that has nodes and edges. Minimum Spanning Tree is a set of edges in an undirected weighted graph that connects all the vertices with no cycles and minimum total edge weight.
-
8
题目¶ 原题地址：https://leetcode.com/problems/minimum-depth...
-
13
Leetcode Minimum Depth of Binary Tree （面试题推荐） 当前位置：XINDOO > 算法 > 正文 我其他lee...
-
12
(Minimum Depth of Binary Tree) 05 Mar 2013 1 Comm...
-
7
Set 2 (Range Minimum Query)Skip to content
-
5
K-Dimensional Tree [Find Minimum]Skip to content
-
7
Kruskal’s Algorithm for Minimum Spanning TreeKruskal’s Algorithm for Minimum Spanning TreePascal's algorithm for computing, the minimum spanning...
-
4
Second Best Minimum Spanning TreeDifficulty Level : HardLast Updated : 23 Jul, 2021Prere...
-
8
Prim's Algorithm for Minimum Spanning TreeSkip to content
-
12
Find the minimum Sub-tree with target sum in a Binary search treeSkip to content
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK