Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
AKASHSAINI
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by AKASHSAINI
18
answers
1
GATE CSE 2016 Set 1 | Question: 39
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight spanning tree of $G$ can have is __________
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight s...
35.1k
views
answered
Jul 6, 2017
Algorithms
gatecse-2016-set1
algorithms
spanning-tree
normal
numerical-answers
+
–
8
answers
2
ISRO2017-17
Which of the following data structure is useful in traversing a given graph by breadth first search? Stack Queue List None of the above
Which of the following data structure is useful in traversing a given graph by breadth first search?StackQueueListNone of the above
13.2k
views
commented
Jul 6, 2017
Algorithms
isro2017
data-structures
graph-algorithms
breadth-first-search
easy
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register