Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
doubt- MST
Hradesh patel
asked
in
Programming in C
Dec 16, 2016
214
views
0
votes
0
votes
#plz check???
Hradesh patel
asked
in
Programming in C
Dec 16, 2016
by
Hradesh patel
214
views
answer
comment
Follow
share this
share
1 comment
by
mcjoshi
commented
Dec 18, 2016
reply
Follow
share this
@Hradesh please Use snipping tool, next time you post an image. It gives a clear view.
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
3
answers
1
iarnav
asked
in
Algorithms
Apr 29, 2018
1,516
views
#Algorithms #MST Doubt in MST Questions.
Question 1) The shortest-path tree computed by Dijkstra's algorithm is necessarily an MST? Question2 ) Prim's algorithm works with negative weighted edges?
iarnav
asked
in
Algorithms
Apr 29, 2018
by
iarnav
1.5k
views
algorithms
minimum-spanning-tree
graph-algorithm
1
vote
1
vote
1
answer
2
iarnav
asked
in
Algorithms
Apr 11, 2018
937
views
#Algorithms MST Question Doubt
Let G be a weighted connected undirected graph with distinct positive edge weights. If every edge weight is decreased by the same value (constraint is - keeping all edge positive all the time), then is it TRUE or FALSE? Shortest path between any pair of vertices does not change?
iarnav
asked
in
Algorithms
Apr 11, 2018
by
iarnav
937
views
algorithms
time-complexity
minimum-spanning-tree
0
votes
0
votes
0
answers
3
iarnav
asked
in
Algorithms
Apr 11, 2018
410
views
#Algorithms Kruskal Algorithm for MST Doubt.
Time Complexity of Kruskal - O(mlogm + n.O(1) + m.logn) mlogm --> for sorting edges in increasing order. n.O(1) --> n UNIONS as we've n nodes in G and each takes O(1) m.logm --> Find operation takes logn time as height of tree can ... we have m edges in G. Now my doubt is - is it O(mlogm) or O(mlogn)? I know, given is O(mlogn), but how?
iarnav
asked
in
Algorithms
Apr 11, 2018
by
iarnav
410
views
algorithms
time-complexity
minimum-spanning-tree
0
votes
0
votes
1
answer
4
Hradesh patel
asked
in
Programming in C
Dec 16, 2016
293
views
MST-test series
Hradesh patel
asked
in
Programming in C
Dec 16, 2016
by
Hradesh patel
293
views
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Programming
(4.1k)
Programming in C
(4.1k)
Programming in Python
(5)
DS
(2.0k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
