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


Python Graph.remove_edge方法代码示例

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


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

示例1: test_remove_unexisting_edge_with_unexisting_vertex

# 需要导入模块: from graphs import Graph [as 别名]
# 或者: from graphs.Graph import remove_edge [as 别名]
    def test_remove_unexisting_edge_with_unexisting_vertex(self):
        """Tests the remove_edge method in a graph between an existing vertex and a non-existing one.
        """
        graph = Graph(graph = { 'A' : [] })

        self.assertFalse(graph.has_edge('A', 'C'), 'There cannot be edge between A and C.')
        graph.remove_edge('A', 'C')
        self.assertFalse(graph.has_edge('A', 'C'), 'Nothing changed.')
开发者ID:informaticienzero,项目名称:Graphs,代码行数:10,代码来源:test_graphs.py

示例2: test_remove_unexisting_edge

# 需要导入模块: from graphs import Graph [as 别名]
# 或者: from graphs.Graph import remove_edge [as 别名]
    def test_remove_unexisting_edge(self):
        """Tests the remove_edge method in a graph without edge between two vertex
        """
        graph = Graph(graph = { 'A' : [], 'B' : [] })

        self.assertFalse(graph.has_edge('A', 'B'), 'There is no edge between A and B.')
        graph.remove_edge('A', 'B')
        self.assertFalse(graph.has_edge('A', 'B'), 'Nothing changed.')
开发者ID:informaticienzero,项目名称:Graphs,代码行数:10,代码来源:test_graphs.py

示例3: test_remove_edge_undirected

# 需要导入模块: from graphs import Graph [as 别名]
# 或者: from graphs.Graph import remove_edge [as 别名]
    def test_remove_edge_undirected(self):
        """Tests the remove_edge method in an undirected graph.
        """
        graph = Graph(graph = { 'A' : ['B'], 'B' : ['A'] })

        self.assertTrue(graph.has_edge('A', 'B'), 'There is an edge between A and B.')
        graph.remove_edge('A', 'B')
        self.assertFalse(graph.has_edge('A', 'B'), 'No more edge between A and B.')
开发者ID:informaticienzero,项目名称:Graphs,代码行数:10,代码来源:test_graphs.py

示例4: test_remove_edge_directed

# 需要导入模块: from graphs import Graph [as 别名]
# 或者: from graphs.Graph import remove_edge [as 别名]
    def test_remove_edge_directed(self):
        """Tests the remove_edge method in a directed graph.
        """
        graph = Graph(graph = { 'A' : ['B'], 'B' : ['A'] }, is_directed = True)

        self.assertTrue(graph.has_edge('A', 'B'), 'There is an edge from A to B.')
        self.assertTrue(graph.has_edge('B', 'A'), 'There is an edge from B to A.')

        graph.remove_edge('A', 'B')

        self.assertFalse(graph.has_edge('A', 'B'), 'There is no more edge from A to B.')
        self.assertTrue(graph.has_edge('B', 'A'), 'But there is still an edge from B to A.')
开发者ID:informaticienzero,项目名称:Graphs,代码行数:14,代码来源:test_graphs.py


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