In graph theory, what algorithm is used to find the minimum spanning tree for a connected weighted graph?
- Bellman-Ford Algorithm
- Dijkstra's Algorithm
- Kruskal's Algorithm
- Prim's Algorithm
Prim's Algorithm is used to find the minimum spanning tree for a connected weighted graph. It starts with an arbitrary node and greedily adds the shortest edge that connects a vertex in the tree to a vertex outside the tree until all vertices are included.
Loading...
Related Quiz
- For a detailed examination of what changed between two commits, the Git command is 'git _______.'
- In ETL, what is the significance of data staging?
- In project management, which KPI is crucial for evaluating the efficiency of resource utilization?
- If x = [10, 20, 30, 40, 50], what is the output of print(x[-2])?
- What is a primary function of BI tools like Tableau and Power BI in data analysis?