'Small graph'

def test_trivial4(self):

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