Suppose that there is an edge in a network that must be included in any spanning tree
Chapter 7, Problem 56(choose chapter or problem)
Suppose that there is an edge in a network that must be included in any spanning tree. Give an algorithm for finding the minimum spanning tree that includes a given edge. (Hint: Modify Kruskals algorithm.)
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer