'Create nested S-blossom, relabel as S, expand recursively:'

def test_nasty_blossom_expand_recursively(self):

    G = nx.Graph()
    G.add_weighted_edges_from([(1, 2, 40), (1, 3, 40), (2, 3, 60), (2, 4, 55), (3, 5, 55), (4, 5, 50), (1, 8, 15), (5, 7, 30), (7, 6, 10), (8, 10, 10), (4, 9, 30)])
    assert_equal(nx.max_weight_matching(G), {1: 2, 2: 1, 3: 5, 4: 9, 5: 3, 6: 7, 7: 6, 8: 10, 9: 4, 10: 8})
