- Q6 Ch Ch Ch Changes 0 3 Points Suppose We Have An Original Graph That Follows The Same Specifications As The Above Agai 1 (94.76 KiB) Viewed 47 times
Q6 Ch-Ch-Ch-Changes 0.3 Points Suppose we have an original graph that follows the same specifications as the above. Again, it is: • simple • connected undirected • has at least one cycle • and the weights of all the edges are distinct. For all the parts below, determine if the MST for the graph changes after making the alteration. All parts are separate. Find the minimal edge M in the graph, and modify the original graph by adding IMI (the edge weight of M) to all edges in graph. After running Kruskal's on the modified graph, we see that the MST: O Always changes O Sometimes changes O Never changes For this part, assume the original graph has at least one negative edge. Modify the original graph by multiplying each negative edge by -1. After running Kruskal's on the modified graph, we see that the MST: O Always changes O Sometimes changes O Never changes For this part, additionally assume the original graph is fully connected, has 3 or more vertices, and every vertex is incident to at least one negative edge. Recall a fully connected graph means an edge exists between every pair of vertices. Modify the original graph by multiplying each edge by -1. After running Kruskalls on the modified graph, we see that the MST: O Always changes O Sometimes changes O Never changes Save Answer