(Choose 1 answer)
Two algorithms, used for finding a minimum spanning tree, are Kruskal and Dijkstra. Which algorithm uses the cycle detection method?
A. The Kruskal algorithm.
B. Belman Ford algorithm.
C. Huffman algorithm
D. Conquer algorithm
E. The Dijkstra algorithm.
7
