Computer Science · Graph Algorithms

Consider the following statements regarding algorithms used to compute Minimum Spanning Trees (MST): Statement 1: Kruskal's algorithm systematically builds an MST by globally sorting all edges in ascending order of weight and repeatedly selecting the smallest edge that does not form a cycle. Statement 2: Prim's algorithm sequentially expands an MST locally by starting from an arbitrary vertex and repeatedly adding the cheapest edge that connects a vertex already in the tree to a vertex outside the tree.