'Small graph with arbitrary weight attribute'

def test_trivial6(self):

    G = nx.Graph()
    G.add_edge('one', 'two', weight=10, abcd=11)
    G.add_edge('two', 'three', weight=11, abcd=10)
    assert_equal(nx.max_weight_matching(G, weight='abcd'), {'one': 'two', 'two': 'one'})
