E001 : Spanning Tree With Maximum Degree | Codeforces

This is an editorial for the problem F1 appeared in Codeforces DIV3 challenge Round 544.
The problem is rated 1600 , and is based on graph theory and Spanning Trees.
The problem can be solved using simple observation and BFS with time complexity O(N+M).
The same problem can also be solved using DSU , but we will be solving this using BFS.
If you are beginner and want to study graph theory in detail , here are playlist i created for that
Graph Theory Part 1 :
Graph Theory Part 2 :


if you think my work is worth praise you can donate using google pay , phone pay , paytm
UPI : 8010248418@ybl

Problem Link :


You can follow me at
Instagram :
Github :
linkedin :

Thank you guys for watching and keep coding.
CodeNCdode

codechef,atcoder,topcoder,codeforces,spoj,uva,hackerearth,hackerrank,competitive coding,competitive programming,tutorial,video tutorial,editorial,video editorial,codechef solution,algorithm,data structure,graph theory,codencode,number theory,number theory course,graph theory course,dp course,dynamic programming course,leetcode,MST,BFS,