1.

Find the odd outSelect one:A. Dijkstra's Minimal Spanning Tree AlgorithmB. Kruskal's Minimal Spanning Tree AlgorithmC. Floyd-Warshall's All pair shortest path AlgorithmD. Prim's Minimal Spanning Tree Algorithm

Answer»

I THINK its ANSWER is C .



Discussion

No Comment Found

Related InterviewSolutions