本文整理汇总了Python中src.graph.Graph.neighbours方法的典型用法代码示例。如果您正苦于以下问题：Python Graph.neighbours方法的具体用法？Python Graph.neighbours怎么用？Python Graph.neighbours使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类src.graph.Graph的用法示例。
在下文中一共展示了Graph.neighbours方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: test_neighbours_in_directed_graph
# 需要导入模块: from src.graph import Graph [as 别名]
# 或者: from src.graph.Graph import neighbours [as 别名]
def test_neighbours_in_directed_graph(self):
g = Graph(True)
g.add_edge((1,2))
g.add_edge((1,3))
expected = [2, 3]
actual = g.neighbours(1)
self.assertEqual(actual, expected, 'should find neighbours of 1')
expected = []
actual = g.neighbours(2)
self.assertEqual(actual, expected, '2 has no neighbours')示例2: test_incident_in_undirected_graph
# 需要导入模块: from src.graph import Graph [as 别名]
# 或者: from src.graph.Graph import neighbours [as 别名]
def test_incident_in_undirected_graph(self):
g = Graph(directed = False)
g.add_edge((2,1))
g.add_edge((3,1))
actual = g.incident(1)
expected = [2, 3]
self.assertEqual(actual, expected, '1 has two incident vertexes')
incident = g.incident(1)
neighbours = g.neighbours(1)
self.assertEqual(incident, neighbours,
'should be the same for undirected graphs')