本文整理汇总了Python中src.graph.Graph.add_vertex方法的典型用法代码示例。如果您正苦于以下问题：Python Graph.add_vertex方法的具体用法？Python Graph.add_vertex怎么用？Python Graph.add_vertex使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类src.graph.Graph的用法示例。
在下文中一共展示了Graph.add_vertex方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: test_incident_invariant_is_preserved_throughout_graph_operations
# 需要导入模块: from src.graph import Graph [as 别名]
# 或者: from src.graph.Graph import add_vertex [as 别名]
def test_incident_invariant_is_preserved_throughout_graph_operations(self):
g = Graph(directed = True)
g.add_vertex(1)
self.assertEqual(g.incident(1), [],
'should have instantiated an empty set of ingress vertices')
g.add_edge((2,1))
g.add_edge((2,1))
self.assertEqual(g.incident(1), [2],
'set of incident vertices is preserved')
self.assertEqual(g.incident(2), [], 'no vertices incident in 2')
g.remove_edge((2,1))
self.assertEqual(g.incident(1), [],
'2 was removed from the list of incident vertices for 3')示例2: test_add_vertex
# 需要导入模块: from src.graph import Graph [as 别名]
# 或者: from src.graph.Graph import add_vertex [as 别名]
def test_add_vertex(self):
g = Graph()
g.add_vertex(1)
self.assertIn(1, g.table, 'should have stored a key in the hash')
self.assertEqual(g.table[1], {}, 'should have stored an empty hash')示例3: test_remove_vertex_removes_value_as_well
# 需要导入模块: from src.graph import Graph [as 别名]
# 或者: from src.graph.Graph import add_vertex [as 别名]
def test_remove_vertex_removes_value_as_well(self):
g = Graph(False)
g.add_vertex(1)
g.set_vertex_value(1, 100)
g.remove_vertex(1)
self.assertIsNone(g.get_vertex_value(1), '1 is no longer in the graph')