2. Which of the following is/are not false? Prims' never accepts cycles in the MST There can be several Minimum costs of spanning tree in one graph |Complexity of Dijstra algorithm can be (V*V)...

2. Which of the following is/are not false?<br>Prims' never accepts cycles in the MST<br>There can be several Minimum costs of spanning tree in one graph<br>|Complexity of Dijstra algorithm can be (V*V)<br>Kruskal can work in weighted directed sparse graph<br>|Weighted interval scheduling requires Dynamic programming<br>|SCC means Shortest connected components<br>Prim's algorithm initialises with a vertex which has smallest edge<br>

Extracted text: 2. Which of the following is/are not false? Prims' never accepts cycles in the MST There can be several Minimum costs of spanning tree in one graph |Complexity of Dijstra algorithm can be (V*V) Kruskal can work in weighted directed sparse graph |Weighted interval scheduling requires Dynamic programming |SCC means Shortest connected components Prim's algorithm initialises with a vertex which has smallest edge

Jun 07, 2022

SOLUTION.PDF

2. Which of the following is/are not false? Prims' never accepts cycles in the MST There can be several Minimum costs of spanning tree in one graph |Complexity of Dijstra algorithm can be (V*V)...

Get Answer To This Question

Related Questions & Answers

Submit New Assignment