本文整理汇总了Python中exp.viroscopy.model.HIVGraph.HIVGraph.endTime方法的典型用法代码示例。如果您正苦于以下问题:Python HIVGraph.endTime方法的具体用法?Python HIVGraph.endTime怎么用?Python HIVGraph.endTime使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类exp.viroscopy.model.HIVGraph.HIVGraph
的用法示例。
在下文中一共展示了HIVGraph.endTime方法的1个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: testAddGraph
# 需要导入模块: from exp.viroscopy.model.HIVGraph import HIVGraph [as 别名]
# 或者: from exp.viroscopy.model.HIVGraph.HIVGraph import endTime [as 别名]
def testAddGraph(self):
epsilon = 0.12
metrics = HIVGraphMetrics2(self.graph, epsilon)
metrics.addGraph(self.graph)
self.assertEquals(metrics.dists[0], 0.0)
self.assertEquals(metrics.meanDistance(), 0.0)
#Start a new graph
#Compute distances directly
matcher = GraphMatch("U")
graph = HIVGraph(self.graph.size)
dists = []
metrics = HIVGraphMetrics2(self.graph, epsilon)
graph.vlist.setInfected(1, 0.0)
graph.vlist.setDetected(1, 0.1, 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)
lastDist = matcher.distance(subgraph1, subgraph2, permutation, True, True)
self.assertEquals(metrics.dists[-1], lastDist)
self.assertTrue(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)
lastDist = matcher.distance(subgraph1, subgraph2, permutation, True, True)
self.assertEquals(metrics.dists[-1], lastDist)
self.assertTrue(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)
lastDist = matcher.distance(subgraph1, subgraph2, permutation, True, True)
self.assertEquals(metrics.dists[-1], lastDist)
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, epsilon)
metrics.addGraph(graph1)
#Problem is that distance is 1 when one graph is zero
self.assertEquals(len(metrics.dists), 0)