本文整理汇总了Python中apgl.graph.SparseGraph.SparseGraph.inDegreeSequence方法的典型用法代码示例。如果您正苦于以下问题：Python SparseGraph.inDegreeSequence方法的具体用法？Python SparseGraph.inDegreeSequence怎么用？Python SparseGraph.inDegreeSequence使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类apgl.graph.SparseGraph.SparseGraph的用法示例。
在下文中一共展示了SparseGraph.inDegreeSequence方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: testGenerate
# 需要导入模块: from apgl.graph.SparseGraph import SparseGraph [as 别名]
# 或者: from apgl.graph.SparseGraph.SparseGraph import inDegreeSequence [as 别名]
def testGenerate(self):
degSequence = numpy.array([2, 1, 3, 0, 0, 0, 0, 0, 0, 1])
generator = ConfigModelGenerator(degSequence)
numVertices = 10
graph = SparseGraph(GeneralVertexList(numVertices))
graph = generator.generate(graph)
tol = 3
self.assertTrue(numpy.linalg.norm(degSequence - graph.degreeSequence()) < tol)
degSequence = numpy.array([2, 1, 3, 0, 2, 1, 4, 0, 0, 1])
generator.setOutDegSequence(degSequence)
graph.removeAllEdges()
graph = generator.generate(graph)
self.assertTrue(numpy.linalg.norm(degSequence - graph.degreeSequence()) < tol)
#Test using a non-empty graph
degSequence = numpy.array([0, 0, 0, 2, 0, 0, 0, 1, 1, 0])
generator.setOutDegSequence(degSequence)
oldDegSequence = graph.degreeSequence()
self.assertRaises(ValueError, generator.generate, graph, True)
graph = generator.generate(graph, False)
diffSequence = graph.degreeSequence() - oldDegSequence
self.assertTrue(numpy.linalg.norm(degSequence - diffSequence) < tol)
#Test the case where we also have an in-degree sequence
degSequence = numpy.array([2, 1, 3, 0, 0, 0, 0, 0, 0, 1])
inDegSequence = numpy.array([1, 1, 1, 1, 1, 1, 1, 0, 0, 0])
generator = ConfigModelGenerator(degSequence, inDegSequence)
graph = SparseGraph(GeneralVertexList(numVertices))
self.assertRaises(ValueError, generator.generate, graph)
graph = SparseGraph(GeneralVertexList(numVertices), False)
graph = generator.generate(graph)
self.assertTrue(numpy.linalg.norm(degSequence - graph.outDegreeSequence()) < tol)
self.assertTrue(numpy.linalg.norm(inDegSequence - graph.inDegreeSequence()) < tol)
outDegSequence = numpy.array([2, 1, 3, 0, 2, 1, 4, 0, 0, 1])
inDegSequence = numpy.array([1, 2, 1, 1, 2, 1, 2, 1, 2, 1])
generator.setOutDegSequence(outDegSequence)
generator.setInDegSequence(inDegSequence)
graph.removeAllEdges()
graph = generator.generate(graph)
self.assertTrue(numpy.linalg.norm(outDegSequence - graph.outDegreeSequence()) < tol)
self.assertTrue(numpy.linalg.norm(inDegSequence - graph.inDegreeSequence()) < tol)
#In the case that the in-degree sequence sum larger than that of the out-degree it is
#not satisfied, but the out-degree should be.
inDegSequence = numpy.array([1, 2, 1, 1, 2, 1, 2, 1, 5, 6])
generator.setInDegSequence(inDegSequence)
graph.removeAllEdges()
graph = generator.generate(graph)
self.assertTrue(numpy.linalg.norm(outDegSequence - graph.outDegreeSequence()) < tol)
#Now try the other way around
generator.setOutDegSequence(inDegSequence)
generator.setInDegSequence(outDegSequence)
graph.removeAllEdges()
graph = generator.generate(graph)
self.assertTrue(numpy.linalg.norm(outDegSequence - graph.inDegreeSequence()) < tol)
#Test growing graph
outDegSequence = numpy.array([2, 1, 3, 0, 2, 1, 4, 0, 0, 1])
inDegSequence = numpy.array([1, 2, 1, 1, 2, 1, 2, 1, 2, 1])
generator.setOutDegSequence(outDegSequence)
generator.setInDegSequence(inDegSequence)
graph.removeAllEdges()
graph = generator.generate(graph)
newOutDegreeSequence = numpy.array([2, 1, 3, 5, 2, 1, 4, 0, 0, 1])
newInDegreeSequence = numpy.array([2, 3, 2, 2, 3, 1, 2, 1, 2, 1])
diffOutSequence = newOutDegreeSequence - graph.outDegreeSequence()
diffInSequence = newInDegreeSequence - graph.inDegreeSequence()
generator.setOutDegSequence(diffOutSequence)
generator.setInDegSequence(diffInSequence)
graph = generator.generate(graph, False)
self.assertTrue(numpy.linalg.norm(newOutDegreeSequence - graph.outDegreeSequence()) < tol)
self.assertTrue(numpy.linalg.norm(newInDegreeSequence - graph.inDegreeSequence()) < tol)