MCPcopy
hub / github.com/donnemartin/interactive-coding-challenges / add_edge

Method add_edge

graphs_trees/graph/graph.py:55–62  ·  view source on GitHub ↗
(self, source_key, dest_key, weight=0)

Source from the content-addressed store, hash-verified

53 return self.nodes[key]
54
55 def add_edge(self, source_key, dest_key, weight=0):
56 if source_key is None or dest_key is None:
57 raise KeyError('Invalid key')
58 if source_key not in self.nodes:
59 self.add_node(source_key)
60 if dest_key not in self.nodes:
61 self.add_node(dest_key)
62 self.nodes[source_key].add_neighbor(self.nodes[dest_key], weight)
63
64 def add_undirected_edge(self, src_key, dst_key, weight=0):
65 if src_key is None or dst_key is None:

Callers 7

add_undirected_edgeMethod · 0.95
test_shortest_pathMethod · 0.95
test_path_existsMethod · 0.80
test_bfsMethod · 0.80
test_shortest_pathMethod · 0.80
test_dfsMethod · 0.80
test_graphMethod · 0.80

Calls 2

add_nodeMethod · 0.95
add_neighborMethod · 0.80

Tested by 6

test_shortest_pathMethod · 0.76
test_path_existsMethod · 0.64
test_bfsMethod · 0.64
test_shortest_pathMethod · 0.64
test_dfsMethod · 0.64
test_graphMethod · 0.64