'Tests that each pair of nodes in the directed graph is
counted once when computing the Wiener index.'

def test_directed(self):

    G = complete_graph(3)
    H = DiGraph(G)
    eq_((2 * wiener_index(G)), wiener_index(H))
