本文整理汇总了Python中src.graph.Graph.remove_edge方法的典型用法代码示例。如果您正苦于以下问题：Python Graph.remove_edge方法的具体用法？Python Graph.remove_edge怎么用？Python Graph.remove_edge使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类src.graph.Graph的用法示例。
在下文中一共展示了Graph.remove_edge方法的4个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Python代码示例。
示例1: ReverseDelete
# 需要导入模块: from src.graph import Graph [as 别名]
# 或者: from src.graph.Graph import remove_edge [as 别名]
class ReverseDelete(object):
name = 'reversedelete'
def __init__(self, save_all_edges=False):
self.queue = PriorityQueue()
self.graph = Graph()
self.logging = False
self.save_all_edges = save_all_edges
self.all_edges = []
def set_logging(self, level):
if level == 'debug':
self.logging = True
def add_edge(self, node1, node2, weight, n, n_nodes, n_edges):
self.queue.put((-weight, (node1, node2)))
if self.save_all_edges:
self.all_edges.append((node1, node2, weight))
def init_from_file(self, f):
self.graph.import_data(f, self.add_edge)
def solve(self):
res = []
while not self.queue.empty():
(weight, edge) = self.queue.get()
self.graph.remove_edge(edge[0], edge[1])
if not self.graph.is_connected():
self.graph.add_edge(edge[0], edge[1], -weight)
res.append((edge[0], edge[1], -weight))
continue
return (self.graph.n_nodes, len(res), res)示例2: test_remove_edge_in_directed_graph
# 需要导入模块: from src.graph import Graph [as 别名]
# 或者: from src.graph.Graph import remove_edge [as 别名]
def test_remove_edge_in_directed_graph(self):
g = Graph(True)
g.add_edge((1,2,10))
g.add_edge((2,3,11))
g.add_edge((3,1,12))
g.remove_edge((2,3))
self.assertEqual(g.table[1][2], 10, 'should have kept the edge')
self.assertEqual(g.table[3][1], 12, 'should have kept the edge')
self.assertEqual(g.table[2], {}, 'should have removed the edge')示例3: test_remove_edge_in_undirected_graph
# 需要导入模块: from src.graph import Graph [as 别名]
# 或者: from src.graph.Graph import remove_edge [as 别名]
def test_remove_edge_in_undirected_graph(self):
g = Graph(False)
g.add_edge((1,2,10))
g.add_edge((2,3,11))
g.add_edge((3,1,12))
g.remove_edge((2,3))
self.assertEqual(g.table[1][2], 10, 'no removals')
self.assertEqual(g.table[1][3], 12, 'no removals')
self.assertEqual(g.table[2][1], 10, 'removed the edge from tail')
self.assertEqual(g.table[3][1], 12, 'removed the edge from head')示例4: test_incident_invariant_is_preserved_throughout_graph_operations
# 需要导入模块: from src.graph import Graph [as 别名]
# 或者: from src.graph.Graph import remove_edge [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')