def test_1(self):
	# Test that we can find new paths by avoiding edges
	# selected from previously found paths.
	# First we generate a graph with paths of various lengths...

	src = ['src']
	a = src
	for i in range(3):
	    b = [i%'b%d']
	    c = ['c%d'%i,b]
	    a.append(b)
	    a.append(c)
	    a = b
	dst = a
	p = self.shpaths(dst, src)

	for avoid, result in [
	    ([],	'%s[1][1][1]'),
	    ([0],	'%s[2][1][1][1]'),
	    ([1],	'%s[1][2][1][1]'),
	    ([2],	'%s[1][1][2][1]'),
	    ([0, 1],	'%s[2][1][2][1][1]'),
	    ([1, 2],	'%s[1][2][1][2][1]'),
#	    ([1, -1],	'%s[1][2][1][2][1]'),
	    ([0, 2],	'%s[2][1][1][2][1]'),
	    ([0, 1, 2],	'%s[2][1][2][1][2][1]'),
	    ([2, 1, 0],	'%s[2][1][2][1][2][1]'),

	    ]:
	    result = result%' 0: Src'
	    # Find new path by avoiding edges from the original path
	    q = self.shpaths(dst, src, avoid_edges=p.edges_at(*avoid))
	    self.aseq(str(q), result)
	    # Find the same path but via a direct method
	    q = p.copy_but_avoid_edges_at_levels(*avoid)
	    self.aseq(str(q), result)
	    # The same, but via a shorter method name
	    q = p.avoided(*avoid)
	    self.aseq(str(q), result)

	# Test that the avoided set is carried on to copies

	q = p.avoided(0).avoided(2)
	self.aseq(str(q), ' 0: Src[2][1][2][1][1]')
dataset/ETHPy150Open cloudera/hue/desktop/core/ext-py/guppy-0.1.10/guppy/heapy/test/test_Path.py/AvoidTestCase.test_1/swapped operands of `%`