def testTimings(self):
numVertices = 100
graph = HIVGraph(numVertices)
graph = ErdosRenyiGenerator(0.1).generate(graph)
graph.vList.V[:, HIVVertices.stateIndex] = HIVVertices.removed
graph.vList.V[:, HIVVertices.detectionTimeIndex] = 0
graph.endEventTime = 0
graph.W = scipy.sparse.csr_matrix(graph.W)
maxSize = 500
metrics = HIVGraphMetrics2(graph, maxSize)
metrics.addGraph(graph)
def testAddGraph(self):
maxSize = 100
metrics = HIVGraphMetrics2(self.graph, maxSize)
metrics.addGraph(self.graph)
self.assertAlmostEquals(metrics.objectives[0], -0.834, 3)
self.assertAlmostEquals(metrics.meanObjective(), -0.834, 3)
#Start a new graph
#Compute distances directly
matcher = GraphMatch("QCV")
graph = HIVGraph(self.graph.size)
dists = []
metrics = HIVGraphMetrics2(self.graph, maxSize)
graph.vlist.setInfected(1, 0.0)
graph.vlist.setDetected(1, 0.1, 0)
graph.endEventTime = 1
metrics.addGraph(graph)
t = graph.endTime()
subgraph1 = graph.subgraph(graph.removedIndsAt(t))
subgraph2 = self.graph.subgraph(graph.removedIndsAt(t))
permutation, distance, time = matcher.match(subgraph1, subgraph2)
lastObj, lastGraphObj, lastLabelObj = matcher.distance(subgraph1, subgraph2, permutation, True, False, True)
self.assertEquals(metrics.objectives[-1], lastObj)
self.assertFalse(metrics.shouldBreak())
graph.vlist.setInfected(2, 2.0)
graph.vlist.setDetected(2, 2.0, 0)
metrics.addGraph(graph)
t = graph.endTime()
subgraph1 = graph.subgraph(graph.removedIndsAt(t))
subgraph2 = self.graph.subgraph(graph.removedIndsAt(t))
permutation, distance, time = matcher.match(subgraph1, subgraph2)
lastObj, lastGraphObj, lastLabelObj = matcher.distance(subgraph1, subgraph2, permutation, True, False, True)
self.assertEquals(metrics.objectives[-1], lastObj)
self.assertFalse(metrics.shouldBreak())
graph.vlist.setInfected(7, 3.0)
graph.vlist.setDetected(7, 3.0, 0)
metrics.addGraph(graph)
t = graph.endTime()
subgraph1 = graph.subgraph(graph.removedIndsAt(t))
subgraph2 = self.graph.subgraph(graph.removedIndsAt(t))
permutation, distance, time = matcher.match(subgraph1, subgraph2)
lastObj, lastGraphObj, lastLabelObj = matcher.distance(subgraph1, subgraph2, permutation, True, False, True)
self.assertEquals(metrics.objectives[-1], lastObj)
self.assertFalse(metrics.shouldBreak())
#Test case where one graph has zero size
graph1 = HIVGraph(10)
graph2 = HIVGraph(10)
graph1.vlist[:, HIVVertices.stateIndex] = HIVVertices.removed
metrics = HIVGraphMetrics2(graph2, maxSize)
metrics.addGraph(graph1)
#Problem is that distance is 1 when one graph is zero
self.assertEquals(len(metrics.objectives), 0)
