Deleting an edge from the connected graph can in no way bring about a graph that has much more than two connected elements. In graph G, length concerning v1 and v2 is 2. Since the shortest route Among the many two paths v1– v4– v2 and v1– v3– v5– v2 https://jacquess406ppq2.answerblogs.com/profile