mirror of
https://github.com/donnemartin/interactive-coding-challenges
synced 2026-01-06 17:38:02 +00:00
Update graph challenge (#122)
Simplify add_node logic. Use more specific TypeError Exception.
This commit is contained in:
@@ -215,20 +215,18 @@
|
||||
" def add_node(self, key):\n",
|
||||
" if key is None:\n",
|
||||
" raise TypeError('key cannot be None')\n",
|
||||
" if key in self.nodes:\n",
|
||||
" return self.nodes[key]\n",
|
||||
" self.nodes[key] = Node(key)\n",
|
||||
" if key not in self.nodes:\n",
|
||||
" self.nodes[key] = Node(key)\n",
|
||||
" return self.nodes[key]\n",
|
||||
"\n",
|
||||
" def add_edge(self, source_key, dest_key, weight=0):\n",
|
||||
" if source_key is None or dest_key is None:\n",
|
||||
" raise Exception('Invalid key')\n",
|
||||
" raise KeyError('Invalid key')\n",
|
||||
" if source_key not in self.nodes:\n",
|
||||
" self.add_node(source_key)\n",
|
||||
" if dest_key not in self.nodes:\n",
|
||||
" self.add_node(dest_key)\n",
|
||||
" self.nodes[source_key].add_neighbor(self.nodes[dest_key],\n",
|
||||
" weight)\n",
|
||||
" self.nodes[source_key].add_neighbor(self.nodes[dest_key], weight)\n",
|
||||
"\n",
|
||||
" def add_undirected_edge(self, src_key, dst_key, weight=0):\n",
|
||||
" if src_key is None or dst_key is None:\n",
|
||||
|
||||
Reference in New Issue
Block a user