LogiQuest
Back to Graphs
11

Kruskal's algorithm builds a minimum spanning tree by:

Easy

Discussion (0)

  • No discussion yet. Ask a doubt or share a shortcut.

Log in to join the discussion.