当前位置: 首页>>代码示例>>Python>>正文


Python SparseGraph.weightMatrixType方法代码示例

本文整理汇总了Python中apgl.graph.SparseGraph.SparseGraph.weightMatrixType方法的典型用法代码示例。如果您正苦于以下问题:Python SparseGraph.weightMatrixType方法的具体用法?Python SparseGraph.weightMatrixType怎么用?Python SparseGraph.weightMatrixType使用的例子?那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在apgl.graph.SparseGraph.SparseGraph的用法示例。


在下文中一共展示了SparseGraph.weightMatrixType方法的1个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Python代码示例。

示例1: testInit

# 需要导入模块: from apgl.graph.SparseGraph import SparseGraph [as 别名]
# 或者: from apgl.graph.SparseGraph.SparseGraph import weightMatrixType [as 别名]
    def testInit(self):
        numVertices = 0
        numFeatures = 1
        vList = VertexList(numVertices, numFeatures)
        graph = SparseGraph(vList)

        numVertices = 10
        numFeatures = 1
        vList = VertexList(numVertices, numFeatures)
        graph = SparseGraph(vList)
        self.assertEquals(graph.weightMatrixType(), scipy.sparse.csr_matrix)

        self.assertRaises(ValueError, SparseGraph, [])
        self.assertRaises(ValueError, SparseGraph, vList, 1)
        self.assertRaises(ValueError, SparseGraph, vList, True, 1)

        #Now test invalid values of W
        W = numpy.zeros((numVertices, numVertices))
        self.assertRaises(ValueError, SparseGraph, vList, True, W)

        W = scipy.sparse.lil_matrix((numVertices+1, numVertices))
        self.assertRaises(ValueError, SparseGraph, vList, True, W)

        W = scipy.sparse.lil_matrix((numVertices, numVertices))
        W[0, 1] = 1
        self.assertRaises(ValueError, SparseGraph, vList, True, W)

        W = scipy.sparse.lil_matrix((numVertices, numVertices))
        graph = SparseGraph(vList, W=W)

        self.assertEquals(graph.weightMatrixType(), scipy.sparse.lil_matrix)
        
        #Test intialising with non-empty graph 
        numVertices = 10 
        W = scipy.sparse.csr_matrix((numVertices, numVertices))
        W[1, 0] = 1.1 
        W[0, 1] = 1.1 
        graph = SparseGraph(numVertices, W=W)
        
        self.assertEquals(graph[1, 0], 1.1)
        
        #Test just specifying number of vertices 
        graph = SparseGraph(numVertices)
        self.assertEquals(graph.size, numVertices)
        
        #Try creating a sparse matrix of dtype int 
        graph = SparseGraph(numVertices, dtype=numpy.int)
        self.assertEquals(graph.W.dtype, numpy.int)
        graph[0, 0] = 1.2 
        
        self.assertEquals(graph[0, 0], 1)
        
        
        #Test the different sparse matrix formats 
        graph = SparseGraph(numVertices, frmt="lil")
        self.assertEquals(type(graph.W), scipy.sparse.lil_matrix)
        
        graph = SparseGraph(numVertices, frmt="csr")
        self.assertEquals(type(graph.W), scipy.sparse.csr_matrix)
        
        graph = SparseGraph(numVertices, frmt="csc")
        self.assertEquals(type(graph.W), scipy.sparse.csc_matrix)
开发者ID:awj223,项目名称:Insight-Data-Engineering-Code-Challenge,代码行数:64,代码来源:SparseGraphTest.py


注:本文中的apgl.graph.SparseGraph.SparseGraph.weightMatrixType方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。