'Creates an example graph and stores the expected minimum and
maximum spanning tree edges.'

def setUp(self):

    self.algo = self.algorithm
    edges = [(0, 1, 7), (0, 3, 5), (1, 2, 8), (1, 3, 9), (1, 4, 7), (2, 4, 5), (3, 4, 15), (3, 5, 6), (4, 5, 8), (4, 6, 9), (5, 6, 11)]
    self.G = nx.Graph()
    self.G.add_weighted_edges_from(edges)
    self.minimum_spanning_edgelist = [(0, 1, {'weight': 7}), (0, 3, {'weight': 5}), (1, 4, {'weight': 7}), (2, 4, {'weight': 5}), (3, 5, {'weight': 6}), (4, 6, {'weight': 9})]
    self.maximum_spanning_edgelist = [(0, 1, {'weight': 7}), (1, 2, {'weight': 8}), (1, 3, {'weight': 9}), (3, 4, {'weight': 15}), (4, 6, {'weight': 9}), (5, 6, {'weight': 11})]
