'Path'

def test_trivial5(self):

    G = nx.Graph()
    G.add_edge(1, 2, weight=5)
    G.add_edge(2, 3, weight=11)
    G.add_edge(3, 4, weight=5)
    assert_equal(nx.max_weight_matching(G), {2: 3, 3: 2})
    assert_equal(nx.max_weight_matching(G, 1), {1: 2, 2: 1, 3: 4, 4: 3})
