def testisSubtree(self):
newTree = DictTree()
newTree.addEdge("a", "b")
newTree.addEdge("a", "c")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("b", "d")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("b", "e")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("e", "f")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("a", "g")
self.assertFalse(newTree.isSubtree(self.dictTree))
newTree = DictTree()
newTree.addEdge("b", "d")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("b", "e")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("e", "f")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("f", "g")
self.assertFalse(newTree.isSubtree(self.dictTree))
newTree = DictTree()
newTree.setVertex("b")
self.assertTrue(newTree.isSubtree(self.dictTree))
self.assertFalse(self.dictTree.isSubtree(newTree))
self.assertTrue(self.dictTree.isSubtree(self.dictTree))
def testisSubtree(self):
newTree = DictTree()
newTree.addEdge("a", "b")
newTree.addEdge("a", "c")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("b", "d")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("b", "e")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("e", "f")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("a", "g")
self.assertFalse(newTree.isSubtree(self.dictTree))
newTree = DictTree()
newTree.addEdge("b", "d")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("b", "e")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("e", "f")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("f", "g")
self.assertFalse(newTree.isSubtree(self.dictTree))
newTree = DictTree()
newTree.setVertex("b")
self.assertTrue(newTree.isSubtree(self.dictTree))
self.assertFalse(self.dictTree.isSubtree(newTree))
self.assertTrue(self.dictTree.isSubtree(self.dictTree))
class DictGraphTest(unittest.TestCase):
def setUp(self):
self.dictTree = DictTree()
self.dictTree.setVertex("a", "foo")
self.dictTree.addEdge("a", "b")
self.dictTree.addEdge("a", "c")
self.dictTree.addEdge("b", "d")
self.dictTree.addEdge("b", "e")
self.dictTree.addEdge("e", "f")
def testInit(self):
dictTree = DictTree()
def testAddEdge(self):
dictTree = DictTree()
dictTree.addEdge("a", "b")
dictTree.addEdge("a", "c")
dictTree.addEdge("d", "a")
#Add duplicate edge
dictTree.addEdge("a", "b")
dictTree.addEdge("a", "c")
dictTree.addEdge("d", "a")
self.assertRaises(ValueError, dictTree.addEdge, "e", "a")
#Add isolated edge
self.assertRaises(ValueError, dictTree.addEdge, "r", "s")
def testGetRoot(self):
dictTree = DictTree()
dictTree.addEdge("a", "b")
dictTree.addEdge("a", "c")
dictTree.addEdge("d", "a")
self.assertEquals(dictTree.getRootId(), "d")
dictTree.addEdge("e", "d")
self.assertEquals(dictTree.getRootId(), "e")
def testSetVertex(self):
dictTree = DictTree()
dictTree.setVertex("a")
self.assertEquals(dictTree.getVertex("a"), None)
self.assertRaises(RuntimeError, dictTree.setVertex, "b")
dictTree.setVertex("a", 12)
self.assertEquals(dictTree.getVertex("a"), 12)
def testStr(self):
dictTree = DictTree()
dictTree.addEdge(0, 1)
dictTree.addEdge(0, 2)
dictTree.addEdge(2, 3)
dictTree.addEdge(2, 4)
dictTree.addEdge(0, 5)
dictTree.addEdge(4, 6)
def testDepth(self):
dictTree = DictTree()
self.assertEquals(dictTree.depth(), 0)
dictTree.setVertex("a")
self.assertEquals(dictTree.depth(), 0)
dictTree.addEdge("a", "b")
dictTree.addEdge("a", "c")
dictTree.addEdge("d", "a")
self.assertEquals(dictTree.depth(), 2)
dictTree.addEdge("c", "e")
self.assertEquals(dictTree.depth(), 3)
def testCutTree(self):
dictTree = DictTree()
dictTree.setVertex("a", "foo")
dictTree.addEdge("a", "b", 2)
dictTree.addEdge("a", "c")
dictTree.addEdge("c", "d", 5)
dictTree.addEdge("c", "f")
A = numpy.array([10, 2])
dictTree.setVertex("b", A)
newTree = dictTree.cut(2)
self.assertEquals(newTree.getVertex("a"), "foo")
self.assertTrue((newTree.getVertex("b") == A).all())
self.assertEquals(newTree.getEdge("a", "b"), 2)
self.assertEquals(newTree.getEdge("a", "c"), 1)
self.assertEquals(newTree.getEdge("c", "d"), 5)
self.assertEquals(newTree.getEdge("c", "f"), 1)
self.assertEquals(newTree.getNumVertices(), dictTree.getNumVertices())
self.assertEquals(newTree.getNumEdges(), dictTree.getNumEdges())
newTree = dictTree.cut(1)
self.assertEquals(newTree.getEdge("a", "b"), 2)
self.assertEquals(newTree.getEdge("a", "c"), 1)
self.assertEquals(newTree.getNumVertices(), 3)
self.assertEquals(newTree.getNumEdges(), 2)
newTree = dictTree.cut(0)
self.assertEquals(newTree.getNumVertices(), 1)
self.assertEquals(newTree.getNumEdges(), 0)
def testLeaves(self):
dictTree = DictTree()
dictTree.setVertex("a", "foo")
self.assertTrue(set(dictTree.leaves()) == set(["a"]))
dictTree.addEdge("a", "b", 2)
dictTree.addEdge("a", "c")
dictTree.addEdge("c", "d", 5)
dictTree.addEdge("c", "f")
self.assertTrue(set(dictTree.leaves()) == set(["b", "d", "f"]))
dictTree.addEdge("b", 1)
dictTree.addEdge("b", 2)
self.assertTrue(set(dictTree.leaves()) == set([1, 2, "d", "f"]))
#Test isSubtree leaves
self.assertTrue(set(dictTree.leaves("c")) == set(["d", "f"]))
self.assertTrue(set(dictTree.leaves("b")) == set([1, 2]))
def testAddChild(self):
dictTree = DictTree()
dictTree.setVertex("a", "foo")
dictTree.addChild("a", "c", 2)
dictTree.addChild("a", "d", 5)
self.assertTrue(set(dictTree.leaves()) == set(["c", "d"]))
self.assertEquals(dictTree.getVertex("c"), 2)
self.assertEquals(dictTree.getVertex("d"), 5)
self.assertTrue(dictTree.getEdge("a", "d"), 1.0)
self.assertTrue(dictTree.getEdge("a", "c"), 1.0)
def testPruneVertex(self):
dictTree = DictTree()
dictTree.setVertex("a", "foo")
dictTree.addEdge("a", "b")
dictTree.addEdge("a", "c")
dictTree.addEdge("b", "d")
dictTree.addEdge("b", "e")
dictTree.addEdge("e", "f")
dictTree.pruneVertex("b")
self.assertFalse(dictTree.edgeExists("b", "e"))
self.assertFalse(dictTree.edgeExists("b", "d"))
self.assertFalse(dictTree.edgeExists("e", "f"))
self.assertTrue(dictTree.vertexExists("b"))
self.assertFalse(dictTree.vertexExists("d"))
self.assertFalse(dictTree.vertexExists("e"))
self.assertFalse(dictTree.vertexExists("f"))
dictTree.pruneVertex("a")
self.assertEquals(dictTree.getNumVertices(), 1)
def testIsLeaf(self):
self.assertTrue(self.dictTree.isLeaf("c"))
self.assertTrue(self.dictTree.isLeaf("d"))
self.assertTrue(self.dictTree.isLeaf("f"))
self.assertFalse(self.dictTree.isLeaf("a"))
self.assertFalse(self.dictTree.isLeaf("b"))
self.assertFalse(self.dictTree.isLeaf("e"))
def testIsNonLeaf(self):
self.assertFalse(self.dictTree.isNonLeaf("c"))
self.assertFalse(self.dictTree.isNonLeaf("d"))
self.assertFalse(self.dictTree.isNonLeaf("f"))
self.assertTrue(self.dictTree.isNonLeaf("a"))
self.assertTrue(self.dictTree.isNonLeaf("b"))
self.assertTrue(self.dictTree.isNonLeaf("e"))
def testCopy(self):
newTree = self.dictTree.copy()
newTree.addEdge("f", "x")
newTree.addEdge("f", "y")
self.assertEquals(newTree.getNumVertices(), self.dictTree.getNumVertices()+2)
self.assertTrue(newTree.vertexExists("x"))
self.assertTrue(newTree.vertexExists("y"))
self.assertTrue(not self.dictTree.vertexExists("x"))
self.assertTrue(not self.dictTree.vertexExists("x"))
def testisSubtree(self):
newTree = DictTree()
newTree.addEdge("a", "b")
newTree.addEdge("a", "c")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("b", "d")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("b", "e")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("e", "f")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("a", "g")
self.assertFalse(newTree.isSubtree(self.dictTree))
newTree = DictTree()
newTree.addEdge("b", "d")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("b", "e")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("e", "f")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("f", "g")
self.assertFalse(newTree.isSubtree(self.dictTree))
newTree = DictTree()
newTree.setVertex("b")
self.assertTrue(newTree.isSubtree(self.dictTree))
self.assertFalse(self.dictTree.isSubtree(newTree))
self.assertTrue(self.dictTree.isSubtree(self.dictTree))
def testDeepCopy(self):
class A:
def __init__(self, x, y):
self.x = x
self.y = y
a = A(1, numpy.array([1, 2]))
self.dictTree.setVertex("a", a)
newTree = self.dictTree.deepCopy()
newTree.addEdge("f", "x")
newTree.addEdge("f", "y")
self.assertEquals(newTree.getNumVertices(), self.dictTree.getNumVertices()+2)
self.assertTrue(newTree.vertexExists("x"))
self.assertTrue(newTree.vertexExists("y"))
self.assertTrue(not self.dictTree.vertexExists("x"))
self.assertTrue(not self.dictTree.vertexExists("x"))
self.assertEquals(self.dictTree.getVertex("a"), a)
self.assertEquals(newTree.getVertex("a").x, 1)
self.assertEquals(self.dictTree.getVertex("a").x, 1)
a.x = 10
self.assertEquals(newTree.getVertex("a").x, 1)
self.assertEquals(self.dictTree.getVertex("a").x, 10)
nptst.assert_array_equal(newTree.getVertex("a").y, numpy.array([1, 2]))
nptst.assert_array_equal(self.dictTree.getVertex("a").y, numpy.array([1, 2]))
a.y = numpy.array([1,2,3])
nptst.assert_array_equal(newTree.getVertex("a").y, numpy.array([1, 2]))
nptst.assert_array_equal(self.dictTree.getVertex("a").y, numpy.array([1, 2, 3]))
def testSubtree(self):
newTree = DictTree()
newTree.addEdge("a", "b")
newTree.addEdge("a", "c")
subtree = newTree.subtreeAt("b")
self.assertEquals(subtree.getAllVertexIds(), ["b"])
subtree = newTree.subtreeAt("c")
self.assertEquals(subtree.getAllVertexIds(), ["c"])
subtree = newTree.subtreeAt("a")
self.assertEquals(set(subtree.getAllVertexIds()), set(["a", "c", "b"]))
class DictGraphTest(unittest.TestCase):
def setUp(self):
self.dictTree = DictTree()
self.dictTree.setVertex("a", "foo")
self.dictTree.addEdge("a", "b")
self.dictTree.addEdge("a", "c")
self.dictTree.addEdge("b", "d")
self.dictTree.addEdge("b", "e")
self.dictTree.addEdge("e", "f")
def testInit(self):
dictTree = DictTree()
def testAddEdge(self):
dictTree = DictTree()
dictTree.addEdge("a", "b")
dictTree.addEdge("a", "c")
dictTree.addEdge("d", "a")
#Add duplicate edge
dictTree.addEdge("a", "b")
dictTree.addEdge("a", "c")
dictTree.addEdge("d", "a")
self.assertRaises(ValueError, dictTree.addEdge, "e", "a")
#Add isolated edge
self.assertRaises(ValueError, dictTree.addEdge, "r", "s")
def testGetRoot(self):
dictTree = DictTree()
dictTree.addEdge("a", "b")
dictTree.addEdge("a", "c")
dictTree.addEdge("d", "a")
self.assertEquals(dictTree.getRootId(), "d")
dictTree.addEdge("e", "d")
self.assertEquals(dictTree.getRootId(), "e")
def testSetVertex(self):
dictTree = DictTree()
dictTree.setVertex("a")
self.assertEquals(dictTree.getVertex("a"), None)
self.assertRaises(RuntimeError, dictTree.setVertex, "b")
dictTree.setVertex("a", 12)
self.assertEquals(dictTree.getVertex("a"), 12)
def testStr(self):
dictTree = DictTree()
dictTree.addEdge(0, 1)
dictTree.addEdge(0, 2)
dictTree.addEdge(2, 3)
dictTree.addEdge(2, 4)
dictTree.addEdge(0, 5)
dictTree.addEdge(4, 6)
def testDepth(self):
dictTree = DictTree()
self.assertEquals(dictTree.depth(), 0)
dictTree.setVertex("a")
self.assertEquals(dictTree.depth(), 0)
dictTree.addEdge("a", "b")
dictTree.addEdge("a", "c")
dictTree.addEdge("d", "a")
self.assertEquals(dictTree.depth(), 2)
dictTree.addEdge("c", "e")
self.assertEquals(dictTree.depth(), 3)
def testCutTree(self):
dictTree = DictTree()
dictTree.setVertex("a", "foo")
dictTree.addEdge("a", "b", 2)
dictTree.addEdge("a", "c")
dictTree.addEdge("c", "d", 5)
dictTree.addEdge("c", "f")
A = numpy.array([10, 2])
dictTree.setVertex("b", A)
newTree = dictTree.cut(2)
self.assertEquals(newTree.getVertex("a"), "foo")
self.assertTrue((newTree.getVertex("b") == A).all())
self.assertEquals(newTree.getEdge("a", "b"), 2)
self.assertEquals(newTree.getEdge("a", "c"), 1)
self.assertEquals(newTree.getEdge("c", "d"), 5)
self.assertEquals(newTree.getEdge("c", "f"), 1)
self.assertEquals(newTree.getNumVertices(), dictTree.getNumVertices())
self.assertEquals(newTree.getNumEdges(), dictTree.getNumEdges())
newTree = dictTree.cut(1)
self.assertEquals(newTree.getEdge("a", "b"), 2)
self.assertEquals(newTree.getEdge("a", "c"), 1)
self.assertEquals(newTree.getNumVertices(), 3)
self.assertEquals(newTree.getNumEdges(), 2)
newTree = dictTree.cut(0)
self.assertEquals(newTree.getNumVertices(), 1)
self.assertEquals(newTree.getNumEdges(), 0)
def testLeaves(self):
dictTree = DictTree()
dictTree.setVertex("a", "foo")
self.assertTrue(set(dictTree.leaves()) == set(["a"]))
dictTree.addEdge("a", "b", 2)
dictTree.addEdge("a", "c")
dictTree.addEdge("c", "d", 5)
dictTree.addEdge("c", "f")
self.assertTrue(set(dictTree.leaves()) == set(["b", "d", "f"]))
dictTree.addEdge("b", 1)
dictTree.addEdge("b", 2)
self.assertTrue(set(dictTree.leaves()) == set([1, 2, "d", "f"]))
#Test isSubtree leaves
self.assertTrue(set(dictTree.leaves("c")) == set(["d", "f"]))
self.assertTrue(set(dictTree.leaves("b")) == set([1, 2]))
def testAddChild(self):
dictTree = DictTree()
dictTree.setVertex("a", "foo")
dictTree.addChild("a", "c", 2)
dictTree.addChild("a", "d", 5)
self.assertTrue(set(dictTree.leaves()) == set(["c", "d"]))
self.assertEquals(dictTree.getVertex("c"), 2)
self.assertEquals(dictTree.getVertex("d"), 5)
self.assertTrue(dictTree.getEdge("a", "d"), 1.0)
self.assertTrue(dictTree.getEdge("a", "c"), 1.0)
def testPruneVertex(self):
dictTree = DictTree()
dictTree.setVertex("a", "foo")
dictTree.addEdge("a", "b")
dictTree.addEdge("a", "c")
dictTree.addEdge("b", "d")
dictTree.addEdge("b", "e")
dictTree.addEdge("e", "f")
dictTree.pruneVertex("b")
self.assertFalse(dictTree.edgeExists("b", "e"))
self.assertFalse(dictTree.edgeExists("b", "d"))
self.assertFalse(dictTree.edgeExists("e", "f"))
self.assertTrue(dictTree.vertexExists("b"))
self.assertFalse(dictTree.vertexExists("d"))
self.assertFalse(dictTree.vertexExists("e"))
self.assertFalse(dictTree.vertexExists("f"))
dictTree.pruneVertex("a")
self.assertEquals(dictTree.getNumVertices(), 1)
def testIsLeaf(self):
self.assertTrue(self.dictTree.isLeaf("c"))
self.assertTrue(self.dictTree.isLeaf("d"))
self.assertTrue(self.dictTree.isLeaf("f"))
self.assertFalse(self.dictTree.isLeaf("a"))
self.assertFalse(self.dictTree.isLeaf("b"))
self.assertFalse(self.dictTree.isLeaf("e"))
def testIsNonLeaf(self):
self.assertFalse(self.dictTree.isNonLeaf("c"))
self.assertFalse(self.dictTree.isNonLeaf("d"))
self.assertFalse(self.dictTree.isNonLeaf("f"))
self.assertTrue(self.dictTree.isNonLeaf("a"))
self.assertTrue(self.dictTree.isNonLeaf("b"))
self.assertTrue(self.dictTree.isNonLeaf("e"))
def testCopy(self):
newTree = self.dictTree.copy()
newTree.addEdge("f", "x")
newTree.addEdge("f", "y")
self.assertEquals(newTree.getNumVertices(),
self.dictTree.getNumVertices() + 2)
self.assertTrue(newTree.vertexExists("x"))
self.assertTrue(newTree.vertexExists("y"))
self.assertTrue(not self.dictTree.vertexExists("x"))
self.assertTrue(not self.dictTree.vertexExists("x"))
def testisSubtree(self):
newTree = DictTree()
newTree.addEdge("a", "b")
newTree.addEdge("a", "c")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("b", "d")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("b", "e")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("e", "f")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("a", "g")
self.assertFalse(newTree.isSubtree(self.dictTree))
newTree = DictTree()
newTree.addEdge("b", "d")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("b", "e")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("e", "f")
self.assertTrue(newTree.isSubtree(self.dictTree))
newTree.addEdge("f", "g")
self.assertFalse(newTree.isSubtree(self.dictTree))
newTree = DictTree()
newTree.setVertex("b")
self.assertTrue(newTree.isSubtree(self.dictTree))
self.assertFalse(self.dictTree.isSubtree(newTree))
self.assertTrue(self.dictTree.isSubtree(self.dictTree))
def testDeepCopy(self):
class A:
def __init__(self, x, y):
self.x = x
self.y = y
a = A(1, numpy.array([1, 2]))
self.dictTree.setVertex("a", a)
newTree = self.dictTree.deepCopy()
newTree.addEdge("f", "x")
newTree.addEdge("f", "y")
self.assertEquals(newTree.getNumVertices(),
self.dictTree.getNumVertices() + 2)
self.assertTrue(newTree.vertexExists("x"))
self.assertTrue(newTree.vertexExists("y"))
self.assertTrue(not self.dictTree.vertexExists("x"))
self.assertTrue(not self.dictTree.vertexExists("x"))
self.assertEquals(self.dictTree.getVertex("a"), a)
self.assertEquals(newTree.getVertex("a").x, 1)
self.assertEquals(self.dictTree.getVertex("a").x, 1)
a.x = 10
self.assertEquals(newTree.getVertex("a").x, 1)
self.assertEquals(self.dictTree.getVertex("a").x, 10)
nptst.assert_array_equal(newTree.getVertex("a").y, numpy.array([1, 2]))
nptst.assert_array_equal(
self.dictTree.getVertex("a").y, numpy.array([1, 2]))
a.y = numpy.array([1, 2, 3])
nptst.assert_array_equal(newTree.getVertex("a").y, numpy.array([1, 2]))
nptst.assert_array_equal(
self.dictTree.getVertex("a").y, numpy.array([1, 2, 3]))
def testSubtree(self):
newTree = DictTree()
newTree.addEdge("a", "b")
newTree.addEdge("a", "c")
subtree = newTree.subtreeAt("b")
self.assertEquals(subtree.getAllVertexIds(), ["b"])
subtree = newTree.subtreeAt("c")
self.assertEquals(subtree.getAllVertexIds(), ["c"])
subtree = newTree.subtreeAt("a")
self.assertEquals(set(subtree.getAllVertexIds()), set(["a", "c", "b"]))
