https://uadoc.uacdn.net/doubts/PJN79EDBRM/163591855689RVL1M0.JPEG

APPLICATIONS OF GREEDY TECHNIQUES
Which of the following statements are true.
If all edge weights are distinct then edge
sequence of Kruskal's for formation of
minimum spanning tree will be unique.
CORRECT ANSWER
If all edge weights are distinct then also we
can have multiple edge sequence for prim's
algorithm.
CORRECT ANSWER
If all edge weights are distinct then also we
can have multiple edge sequence for
Kruskal's algorithm.
If edge weight of some of the edges are
same then we can have more than 1 edge
sequence for Kruskal's algorithm.
CORRECT ANSWER


Hindi

Revised solution

English

Educator solution

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Doubt solution

Doubt details

CS & IT

AUTO-GENERATED

Solutions available

Revised solution

Educator solution