def testAddEdge(self):
dictGraph = DictGraph()
dictGraph.addEdge("A", "B", [1,2,3])
dictGraph.addEdge("A", "C", "HelloThere")
dictGraph.addEdge(12, 8, [1,2,3, 12])
self.assertEquals(dictGraph.getEdge("A", "B"), [1,2,3])
self.assertEquals(dictGraph.getEdge("B", "A"), [1,2,3])
self.assertEquals(dictGraph.getEdge("A", "C"), "HelloThere")
self.assertEquals(dictGraph.getEdge("C", "A"), "HelloThere")
self.assertEquals(dictGraph.getEdge(12, 8), [1,2,3, 12])
self.assertEquals(dictGraph.getEdge(8, 12), [1,2,3, 12])
dictGraph.addEdge(2, 8)
dictGraph = DictGraph(False)
dictGraph.addEdge("A", "B", [1,2,3])
dictGraph.addEdge("A", "C", "HelloThere")
dictGraph.addEdge(12, 8, [1,2,3, 12])
self.assertEquals(dictGraph.getEdge("A", "B"), [1,2,3])
self.assertEquals(dictGraph.getEdge("B", "A"), None)
self.assertEquals(dictGraph.getEdge("A", "C"), "HelloThere")
self.assertEquals(dictGraph.getEdge("C", "A"), None)
self.assertEquals(dictGraph.getEdge(12, 8), [1,2,3, 12])
self.assertEquals(dictGraph.getEdge(8, 12), None)
dictGraph.addEdge(2, 8)
def testGetWeightMatrix(self):
graph = DictGraph()
graph.addEdge("a", "b")
graph.addEdge("a", "c")
graph.addEdge("a", "d")
graph.addEdge("d", "e")
W = graph.getWeightMatrix()
keys = graph.getAllVertexIds()
for i in range(len(keys)):
for j in range(len(keys)):
if W[i, j] == 1:
self.assertEquals(graph.getEdge(keys[i], keys[j]), 1)
else:
self.assertEquals(graph.getEdge(keys[i], keys[j]), None)
#Try a directed graph
graph = DictGraph(False)
graph.addEdge("a", "b")
graph.addEdge("a", "c")
graph.addEdge("a", "d")
graph.addEdge("d", "e")
W = graph.getWeightMatrix()
for i in range(len(keys)):
for j in range(len(keys)):
if W[i, j] == 1:
self.assertEquals(graph.getEdge(keys[i], keys[j]), 1)
else:
self.assertEquals(graph.getEdge(keys[i], keys[j]), None)
def testGetNeighbours(self):
dictGraph = DictGraph(True)
dictGraph.addEdge(1, 2, 12)
dictGraph.addEdge(1, 3, 18)
dictGraph.addEdge(1, 4, 1)
dictGraph.addEdge(3, 4, 1)
dictGraph.addEdge(2, 2, 1)
dictGraph.setVertex(5, 12)
self.assertEquals(dictGraph.neighbours(1), [2, 3, 4])
self.assertEquals(dictGraph.neighbours(3), [1, 4])
self.assertEquals(dictGraph.neighbours(2), [1, 2])
self.assertEquals(dictGraph.neighbours(5), [])
#Directed graphs
dictGraph = DictGraph(False)
dictGraph.addEdge(1, 2, 12)
dictGraph.addEdge(1, 3, 18)
dictGraph.addEdge(1, 4, 1)
dictGraph.addEdge(3, 4, 1)
dictGraph.addEdge(2, 2, 1)
dictGraph.setVertex(5, 12)
self.assertEquals(dictGraph.neighbours(1), [2,3,4])
self.assertEquals(dictGraph.neighbours(3), [4])
self.assertEquals(dictGraph.neighbours(2), [2])
self.assertEquals(dictGraph.neighbours(5), [])
def testGetVertex(self):
dictGraph = DictGraph(True)
dictGraph.addEdge(1, 2, 12)
dictGraph.addEdge(1, 3, 18)
dictGraph.setVertex(5, 12)
self.assertEquals(dictGraph.getVertex(1), None)
self.assertEquals(dictGraph.getVertex(2), None)
self.assertEquals(dictGraph.getVertex(3), None)
self.assertEquals(dictGraph.getVertex(5), 12)
self.assertRaises(ValueError, dictGraph.getVertex, 4)
#Directed graphs
dictGraph = DictGraph(False)
dictGraph.addEdge(1, 2, 12)
dictGraph.addEdge(1, 3, 18)
dictGraph.setVertex(5, 12)
self.assertEquals(dictGraph.getVertex(1), None)
self.assertEquals(dictGraph.getVertex(2), None)
self.assertEquals(dictGraph.getVertex(3), None)
self.assertEquals(dictGraph.getVertex(5), 12)
self.assertRaises(ValueError, dictGraph.getVertex, 4)
def testGetAllEdgeIndices(self):
graph = DictGraph()
graph.addEdge("a", "b")
graph.addEdge("a", "c")
graph.addEdge("a", "d")
graph.addEdge("d", "e")
edgeIndices = graph.getAllEdgeIndices()
keys = graph.getAllVertexIds()
self.assertEquals(edgeIndices.shape[0], graph.getNumEdges())
for i in range(edgeIndices.shape[0]):
self.assertTrue(graph.getEdge(keys[int(edgeIndices[i, 0])], keys[edgeIndices[i, 1]]) == 1)
graph = DictGraph(False)
graph.addEdge("a", "b")
graph.addEdge("b", "a")
graph.addEdge("a", "c")
graph.addEdge("a", "d")
graph.addEdge("d", "e")
edgeIndices = graph.getAllEdgeIndices()
keys = graph.getAllVertexIds()
self.assertEquals(edgeIndices.shape[0], graph.getNumEdges())
for i in range(edgeIndices.shape[0]):
self.assertTrue(graph.getEdge(keys[int(edgeIndices[i, 0])], keys[edgeIndices[i, 1]]) == 1)
def testAddEdges(self):
graph = DictGraph()
edgeList = [(1, 2), (2, 1), (5, 2), (8, 8)]
graph.addEdges(edgeList)
self.assertEquals(graph.getNumEdges(), 3)
self.assertEquals(graph.getEdge(1, 2), 1)
self.assertEquals(graph.getEdge(5, 2), 1)
self.assertEquals(graph.getEdge(2, 1), 1)
self.assertEquals(graph.getEdge(8, 8), 1)
edgeValues = [1, 2, 3, 4]
graph.addEdges(edgeList, edgeValues)
self.assertEquals(graph.getEdge(1, 2), 2)
self.assertEquals(graph.getEdge(5, 2), 3)
self.assertEquals(graph.getEdge(2, 1), 2)
self.assertEquals(graph.getEdge(8, 8), 4)
#Now test directed graphs
graph = DictGraph(False)
graph.addEdges(edgeList)
self.assertEquals(graph.getNumEdges(), 4)
self.assertEquals(graph.getEdge(1, 2), 1)
self.assertEquals(graph.getEdge(5, 2), 1)
self.assertEquals(graph.getEdge(2, 1), 1)
self.assertEquals(graph.getEdge(8, 8), 1)
edgeValues = [1, 2, 3, 4]
graph.addEdges(edgeList, edgeValues)
self.assertEquals(graph.getEdge(1, 2), 1)
self.assertEquals(graph.getEdge(5, 2), 3)
self.assertEquals(graph.getEdge(2, 1), 2)
self.assertEquals(graph.getEdge(8, 8), 4)
def testNeighbourOf(self):
graph = DictGraph(True)
graph.addEdge(0, 1)
graph.addEdge(0, 2)
graph.addEdge(0, 3)
graph.addEdge(1, 2)
graph.addEdge(2, 3)
for i in range(4):
self.assertEquals(graph.neighbours(i), graph.neighbourOf(i))
#Now test directed graph
graph = DictGraph(False)
graph.addEdge(0, 1)
graph.addEdge(0, 2)
graph.addEdge(0, 3)
graph.addEdge(1, 2)
graph.addEdge(2, 3)
self.assertEquals(graph.neighbourOf(0), [])
self.assertEquals(graph.neighbourOf(1), [0])
self.assertEquals(graph.neighbourOf(2), [0,1])
self.assertEquals(graph.neighbourOf(3), [0, 2])
def testDensity(self):
numVertices = 10
graph = DictGraph(True)
for i in range(numVertices):
graph.setVertex(i, 0)
graph.addEdge(0, 1)
self.assertEquals(graph.density(), float(1)/45)
graph.addEdge(0, 2)
self.assertEquals(graph.density(), float(2)/45)
graph = DictGraph(False)
for i in range(numVertices):
graph.setVertex(i, 0)
graph.addEdge(0, 1)
self.assertEquals(graph.density(), float(1)/90)
graph.addEdge(0, 2)
self.assertEquals(graph.density(), float(2)/90)
#Test a graph with 1 vertex
graph = DictGraph(True)
graph.setVertex(0, 12)
self.assertEquals(graph.density(), 0)
graph.addEdge(0, 0)
self.assertEquals(graph.density(), 1)
def testGetNumEdges(self):
dictGraph = DictGraph(True)
self.assertEquals(dictGraph.getNumEdges(), 0)
dictGraph.addEdge(1, 2, 12)
dictGraph.addEdge(1, 3, 18)
dictGraph.addEdge(3, 4, 1)
self.assertEquals(dictGraph.getNumEdges(), 3)
dictGraph.addEdge(3, 4, 1)
self.assertEquals(dictGraph.getNumEdges(), 3)
dictGraph.addEdge(3, 5, 1)
self.assertEquals(dictGraph.getNumEdges(), 4)
dictGraph.addEdge(3, 3, 1)
self.assertEquals(dictGraph.getNumEdges(), 5)
#Identical tests with directed graphs
dictGraph = DictGraph(False)
self.assertEquals(dictGraph.getNumEdges(), 0)
dictGraph.addEdge(1, 2, 12)
dictGraph.addEdge(1, 3, 18)
dictGraph.addEdge(3, 4, 1)
self.assertEquals(dictGraph.getNumEdges(), 3)
dictGraph.addEdge(3, 4, 1)
self.assertEquals(dictGraph.getNumEdges(), 3)
dictGraph.addEdge(3, 5, 1)
self.assertEquals(dictGraph.getNumEdges(), 4)
dictGraph.addEdge(3, 3, 1)
self.assertEquals(dictGraph.getNumEdges(), 5)
def setUp(self):
#Let's set up a very simple graph
numVertices = 5
numFeatures = 1
edges = []
vList = VertexList(numVertices, numFeatures)
#An undirected dense graph
self.dGraph1 = DenseGraph(vList, True)
self.dGraph1.addEdge(0, 1, 1)
self.dGraph1.addEdge(0, 2, 1)
self.dGraph1.addEdge(2, 4, 1)
self.dGraph1.addEdge(2, 3, 1)
self.dGraph1.addEdge(3, 4, 1)
#A directed sparse graph
self.dGraph2 = DenseGraph(vList, False)
self.dGraph2.addEdge(0, 1, 1)
self.dGraph2.addEdge(0, 2, 1)
self.dGraph2.addEdge(2, 4, 1)
self.dGraph2.addEdge(2, 3, 1)
self.dGraph2.addEdge(3, 4, 1)
#Now try sparse graphs
vList = VertexList(numVertices, numFeatures)
self.sGraph1 = SparseGraph(vList, True)
self.sGraph1.addEdge(0, 1, 1)
self.sGraph1.addEdge(0, 2, 1)
self.sGraph1.addEdge(2, 4, 1)
self.sGraph1.addEdge(2, 3, 1)
self.sGraph1.addEdge(3, 4, 1)
self.sGraph2 = SparseGraph(vList, False)
self.sGraph2.addEdge(0, 1, 1)
self.sGraph2.addEdge(0, 2, 1)
self.sGraph2.addEdge(2, 4, 1)
self.sGraph2.addEdge(2, 3, 1)
self.sGraph2.addEdge(3, 4, 1)
#Finally, try DictGraphs
self.dctGraph1 = DictGraph(True)
self.dctGraph1.addEdge(0, 1, 1)
self.dctGraph1.addEdge(0, 2, 2)
self.dctGraph1.addEdge(2, 4, 8)
self.dctGraph1.addEdge(2, 3, 1)
self.dctGraph1.addEdge(12, 4, 1)
self.dctGraph2 = DictGraph(False)
self.dctGraph2.addEdge(0, 1, 1)
self.dctGraph2.addEdge(0, 2, 1)
self.dctGraph2.addEdge(2, 4, 1)
self.dctGraph2.addEdge(2, 3, 1)
self.dctGraph2.addEdge(12, 4, 1)
def testDijkstrasAlgorithm(self):
graph = DictGraph()
graph.addEdge(0, 1, 1)
graph.addEdge(1, 2, 1)
graph.addEdge(1, 3, 1)
graph.addEdge(2, 4, 1)
graph.setVertex(4, 1)
self.assertTrue((graph.dijkstrasAlgorithm(0) == numpy.array([0, 1, 2, 2, 3])).all())
self.assertTrue((graph.dijkstrasAlgorithm(1) == numpy.array([1, 0, 1, 1, 2])).all())
self.assertTrue((graph.dijkstrasAlgorithm(2) == numpy.array([2, 1, 0, 2, 1])).all())
self.assertTrue((graph.dijkstrasAlgorithm(3) == numpy.array([2, 1, 2, 0, 3])).all())
self.assertTrue((graph.dijkstrasAlgorithm(4) == numpy.array([3, 2, 1, 3, 0])).all())
#Test a graph which has an isolated node
graph = DictGraph()
graph.setVertex(5, 1)
graph.addEdge(0, 1, 1)
graph.addEdge(1, 2, 1)
graph.addEdge(1, 3, 1)
self.assertTrue((graph.dijkstrasAlgorithm(0) == numpy.array([0, 1, 2, 2, numpy.inf])).all())
#Test a graph in a ring
graph = DictGraph()
graph.addEdge(0, 1, 1)
graph.addEdge(1, 2, 1)
graph.addEdge(2, 3, 1)
graph.addEdge(3, 4, 1)
graph.addEdge(4, 0, 1)
self.assertTrue((graph.dijkstrasAlgorithm(0) == numpy.array([0, 1, 2, 2, 1])).all())
#Try case in which vertex ids are not numbers
graph = DictGraph()
graph.addEdge("a", "b", 1)
graph.addEdge("b", "c", 1)
graph.addEdge("b", "d", 1)
graph.addEdge("c", "e", 1)
inds = Util.argsort(graph.getAllVertexIds())
self.assertTrue((graph.dijkstrasAlgorithm("a")[inds] == numpy.array([0, 1, 2, 2, 3])).all())
self.assertTrue((graph.dijkstrasAlgorithm("b")[inds] == numpy.array([1, 0, 1, 1, 2])).all())
self.assertTrue((graph.dijkstrasAlgorithm("c")[inds] == numpy.array([2, 1, 0, 2, 1])).all())
self.assertTrue((graph.dijkstrasAlgorithm("d")[inds] == numpy.array([2, 1, 2, 0, 3])).all())
self.assertTrue((graph.dijkstrasAlgorithm("e")[inds] == numpy.array([3, 2, 1, 3, 0])).all())
def testGetEdge(self):
dictGraph = DictGraph(True)
dictGraph.addEdge(1, 2, 12)
self.assertEquals(dictGraph.getEdge(1, 2), 12)
self.assertEquals(dictGraph.getEdge(2, 1), 12)
self.assertEquals(dictGraph.getEdge(2, 2), None)
self.assertRaises(ValueError, dictGraph.getEdge, 5, 8)
dictGraph = DictGraph(False)
dictGraph.addEdge(1, 2, 12)
self.assertEquals(dictGraph.getEdge(1, 2), 12)
self.assertEquals(dictGraph.getEdge(2, 1), None)
def testRemoveVertex(self):
graph = DictGraph()
graph.addEdge(0, 1)
graph.addEdge(0, 2)
graph.addEdge(0, 3)
graph.addEdge(1, 2)
graph.addEdge(2, 3)
graph.addEdge(3, 4)
graph.removeVertex(4)
self.assertFalse(graph.vertexExists(4))
self.assertFalse(graph.edgeExists(3, 4))
graph.removeVertex(3)
self.assertFalse(graph.vertexExists(3))
self.assertFalse(graph.edgeExists(2, 3))
self.assertFalse(graph.edgeExists(0, 3))
graph.removeVertex(2)
self.assertFalse(graph.vertexExists(2))
self.assertFalse(graph.edgeExists(1, 2))
self.assertFalse(graph.edgeExists(0, 2))
self.assertTrue(graph.getAllVertexIds() == [0, 1])
self.assertTrue(graph.getAllEdges() == [(0, 1)])
#Try directed graph
graph = DictGraph(False)
graph.addEdge(0, 1)
graph.addEdge(1, 0)
graph.addEdge(0, 3)
graph.addEdge(1, 2)
graph.addEdge(2, 3)
graph.addEdge(3, 4)
graph.removeVertex(0)
self.assertFalse(graph.vertexExists(0))
self.assertFalse(graph.edgeExists(0, 1))
self.assertFalse(graph.edgeExists(0, 3))
self.assertFalse(graph.edgeExists(1, 0))
graph.removeVertex(2)
self.assertFalse(graph.vertexExists(2))
self.assertFalse(graph.edgeExists(1, 2))
self.assertFalse(graph.edgeExists(2, 3))
self.assertTrue(graph.getAllVertexIds() == [1, 3, 4])
self.assertTrue(graph.getAllEdges() == [(3, 4)])
def setUp(self):
#Finally, try DictGraphs
self.dctGraph1 = DictGraph(True)
self.dctGraph1.addEdge(0, 1, 1)
self.dctGraph1.addEdge(0, 2, 2)
self.dctGraph1.addEdge(2, 4, 8)
self.dctGraph1.addEdge(2, 3, 1)
self.dctGraph1.addEdge(12, 4, 1)
self.dctGraph2 = DictGraph(False)
self.dctGraph2.addEdge(0, 1, 0.5)
self.dctGraph2.addEdge(0, 2, 1)
self.dctGraph2.addEdge(2, 4, 1)
self.dctGraph2.addEdge(2, 3, 0.2)
self.dctGraph2.addEdge(12, 4, 1)
def testGetAllVertexIds(self):
dictGraph = DictGraph(True)
dictGraph.addEdge(1, 2, 12)
dictGraph.addEdge(1, 3, 18)
dictGraph.setVertex(5, 12)
self.assertEquals(dictGraph.getAllVertexIds(), [1, 2, 3, 5])
def __init__(self, purchasesByWeek, nb_purchases_per_it=None):
"""
The background graph is a bi-partite graph of purchases. Purchases are
grouped by date (week by week), and we consider the graph of purchases
between first week and $i$-th week.
The returned graph considers only users and counts the number of common
purchases between two users.
Purchases are given in a list of [user, prod, week, year] with increasing
date.
nb_purchases_per_it is the maximum number of purchases to put in each
week (if there is more, randomly split the week). None corresponds to
no-limit case.
"""
# args
self.group_by_iterator = DatedPurchasesGroupByIterator(
purchasesByWeek, nb_purchases_per_it)
# init variables
self.dictUser = MyDictionary()
self.dictProd = MyDictionary()
for user, prod, week, year in purchasesByWeek:
self.dictUser.index(user)
self.dictProd.index(prod)
self.backgroundGraph = DictGraph(False) # directed
self.W = scipy.sparse.csr_matrix(
(len(self.dictUser), len(self.dictUser)), dtype='int16')
self.usefullEdges = numpy.array([])
def testGetNumDirEdges(self):
graph = DictGraph()
graph.addEdge(0, 1, 0.1)
graph.addEdge(1, 2, 0.1)
self.assertTrue(graph.getNumDirEdges() == 4)
graph.addEdge(1, 1)
self.assertTrue(graph.getNumDirEdges() == 5)
graph = DictGraph(False)
graph.addEdge(0, 1)
graph.addEdge(1, 2)
self.assertTrue(graph.getNumDirEdges() == 2)
graph.addEdge(1, 1)
self.assertTrue(graph.getNumDirEdges() == 3)
def testSetItem(self):
graph = DictGraph()
graph.addEdge(1, 1, 0.1)
graph.addEdge(1, 3, 0.5)
self.assertEquals(graph[1,3], 0.5)
graph[1, 3] = 2
self.assertEquals(graph[1,3], 2)
def setUp(self):
self.graph = DictGraph()
self.graph.addEdge(0, 1, 1)
self.graph.addEdge(1, 3, 1)
self.graph.addEdge(0, 2, 2)
self.graph.addEdge(2, 3, 5)
self.graph.addEdge(0, 4, 1)
self.graph.addEdge(3, 4, 1)
self.graph.setVertex(5, None)
self.graph2 = DictGraph(False)
self.graph2.addEdge(0, 1, 1)
self.graph2.addEdge(1, 3, 1)
self.graph2.addEdge(0, 2, 2)
self.graph2.addEdge(2, 3, 5)
self.graph2.addEdge(0, 4, 1)
self.graph2.addEdge(3, 4, 1)
self.graph2.setVertex(5, 1)
def testSubgraph(self):
graph = DictGraph()
graph.addEdge(0, 1)
graph.addEdge(0, 2)
graph.addEdge(0, 3)
graph.addEdge(1, 2)
graph.addEdge(2, 3)
graph.setVertex(0, "abc")
graph.setVertex(3, "cde")
self.assertEquals(graph.getNumEdges(), 5)
subgraph = graph.subgraph([0, 1, 2])
self.assertEquals(subgraph.getNumVertices(), 3)
self.assertEquals(subgraph.getNumEdges(), 3)
self.assertEquals(subgraph.isUndirected(), True)
self.assertEquals(subgraph.getEdge(0, 1), 1)
self.assertEquals(subgraph.getEdge(0, 2), 1)
self.assertEquals(subgraph.getEdge(1, 2), 1)
self.assertEquals(subgraph.getVertex(0), "abc")
#Check the original graph is fine
self.assertEquals(graph.getNumVertices(), 4)
self.assertEquals(graph.getNumEdges(), 5)
self.assertEquals(graph.getVertex(0), "abc")
self.assertEquals(graph.getVertex(3), "cde")
#Now a quick test for directed graphs
graph = DictGraph(False)
graph.addEdge(0, 1)
graph.addEdge(0, 2)
graph.addEdge(0, 3)
graph.addEdge(1, 2)
graph.addEdge(2, 3)
subgraph = graph.subgraph([0, 1, 2])
self.assertEquals(subgraph.getNumEdges(), 3)
self.assertEquals(subgraph.isUndirected(), False)
self.assertEquals(subgraph.getEdge(0, 1), 1)
self.assertEquals(subgraph.getEdge(0, 2), 1)
self.assertEquals(subgraph.getEdge(1, 2), 1)
def testGetItem(self):
graph = DictGraph()
graph.addEdge(1, 1, 0.1)
graph.addEdge(1, 3, 0.5)
graph.addEdge(2, 4, 1)
graph.addEdge(2, 3, 2)
graph.setVertex(0, "abc")
self.assertEquals(graph[1,1], 0.1)
self.assertEquals(graph[1,3], 0.5)
def toDictGraph(self):
"""
Convert to a DictGraph object. Currently ignores vertex labels.
:return graph: A DictGraph object.
"""
edges = self.getAllEdges()
values = self.getEdgeValues(edges)
graph = DictGraph(self.undirected)
graph.addEdges(edges, values)
return graph
def testDepthFirstSearch(self):
graph = DictGraph()
graph.addEdge(0, 1)
graph.addEdge(1, 2)
graph.addEdge(1, 3)
graph.addEdge(2, 6)
graph.addEdge(4, 5)
self.assertEquals(graph.depthFirstSearch(0), [0,1,2,6,3])
self.assertEquals(graph.depthFirstSearch(1), [1,0,2,6,3])
self.assertEquals(graph.depthFirstSearch(6), [6,2,1,0,3])
self.assertEquals(graph.depthFirstSearch(4), [4, 5])
self.assertEquals(graph.depthFirstSearch(5), [5, 4])
def testVertexExists(self):
graph = DictGraph(False)
graph.addEdge(0, 1)
graph.addEdge(0, 2)
graph.addEdge(0, 3)
graph.addEdge(1, 2)
graph.addEdge(2, 3)
self.assertTrue(graph.vertexExists(0))
self.assertTrue(graph.vertexExists(1))
self.assertTrue(graph.vertexExists(2))
self.assertTrue(graph.vertexExists(3))
self.assertFalse(graph.vertexExists(4))
def testAddVertex(self):
dictGraph = DictGraph(True)
dictGraph.addEdge(1, 2, 12)
dictGraph.addEdge(1, 3, 18)
dictGraph.setVertex(5, 12)
self.assertEquals(dictGraph.getVertex(5), 12)
dictGraph.setVertex(5, 22)
self.assertEquals(dictGraph.getVertex(5), 22)
dictGraph.addEdge(5, 11, 18)
self.assertEquals(dictGraph.getVertex(5), 22)
def testSetVertices(self):
graph = DictGraph()
vertexIndices = [1, 2, 3]
vertices = ["a", "b", "c"]
graph.setVertices(vertexIndices, vertices)
vertexIndices2 = graph.getAllVertexIds()
vertices2 = graph.getVertices(vertexIndices2)
self.assertEquals(vertexIndices, vertexIndices2)
self.assertEquals(vertices, vertices2)
def testGetSparseWeightMatrix(self):
graph = DictGraph()
graph.addEdge("a", "b")
graph.addEdge("a", "c")
graph.addEdge("a", "d", "blah")
graph.addEdge("d", "e", -1.1)
graph.addEdge("c", "b", 2)
W = graph.getSparseWeightMatrix()
keys = graph.getAllVertexIds()
for i in range(len(keys)):
for j in range(len(keys)):
if graph.edgeExists(keys[i], keys[j]) and not isinstance(graph.getEdge(keys[i], keys[j]), numbers.Number):
self.assertEquals(1, W[i, j])
elif W[i, j] != 0:
self.assertEquals(graph.getEdge(keys[i], keys[j]), W[i, j])
else:
self.assertEquals(graph.getEdge(keys[i], keys[j]), None)
#Try a directed graph
graph = DictGraph(False)
graph.addEdge("a", "b")
graph.addEdge("a", "c", "test")
graph.addEdge("a", "d")
graph.addEdge("d", "e")
graph.addEdge("c", "a", 0.1)
W = graph.getSparseWeightMatrix()
for i in range(len(keys)):
for j in range(len(keys)):
if graph.edgeExists(keys[i], keys[j]) and not isinstance(graph.getEdge(keys[i], keys[j]), numbers.Number):
self.assertEquals(1, W[i, j])
elif W[i, j] != 0:
self.assertEquals(graph.getEdge(keys[i], keys[j]), W[i, j])
else:
self.assertEquals(graph.getEdge(keys[i], keys[j]), None)
def testInDegreeSequence(self):
graph = DictGraph(True)
graph.addEdge(0, 1)
graph.addEdge(0, 2)
graph.addEdge(0, 3)
graph.addEdge(1, 2)
graph.addEdge(2, 3)
degSeq, vertices = graph.inDegreeSequence()
self.assertTrue((degSeq == numpy.array([ 3, 2, 3, 2.])).all())
self.assertTrue(vertices == [0, 1, 2, 3])
#Test results on a directed graph
graph = DictGraph(False)
graph.addEdge(0, 1)
graph.addEdge(0, 2)
graph.addEdge(0, 3)
graph.addEdge(1, 2)
graph.addEdge(2, 3)
degSeq, vertices = graph.inDegreeSequence()
self.assertTrue((degSeq == numpy.array([ 0, 1, 2, 2])).all())
def testRemoveEdge(self):
dictGraph = DictGraph()
dictGraph.addEdge(1, 2, 12)
dictGraph.addEdge(1, 3, 18)
dictGraph.addEdge(3, 4, 1)
self.assertEquals(dictGraph.getEdge(1, 2), 12)
self.assertEquals(dictGraph.getEdge(1, 3), 18)
self.assertEquals(dictGraph.getEdge(3, 4), 1)
dictGraph.removeEdge(1, 3)
self.assertEquals(dictGraph.getEdge(1, 3), None)
self.assertEquals(dictGraph.getEdge(1, 2), 12)
self.assertEquals(dictGraph.getEdge(3, 4), 1)
#Some tests on directed graphs
dictGraph = DictGraph(False)
dictGraph.addEdge(1, 2, 12)
dictGraph.addEdge(2, 1, 12)
dictGraph.removeEdge(1, 2)
self.assertEquals(dictGraph.getEdge(1, 2), None)
self.assertEquals(dictGraph.getEdge(2, 1), 12)
def testDegreeSequence(self):
graph = DictGraph()
graph.setVertex("a", 10)
graph["b", "c"] = 1
graph["b", "d"] = 1
graph["d", "e"] = 1
graph["e", "e"] = 1
degreeDict = {}
degreeDict2 = {"a": 0, "b": 2, "c": 1, "d": 2, "e": 3}
for i, id in enumerate(graph.getAllVertexIds()):
degreeDict[id] = graph.degreeSequence()[i]
self.assertEquals(degreeDict, degreeDict2)
