GitHub/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges synced 2026-01-07 01:48:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Revised path exists challenge algorithm discussion.

Browse Source
This commit is contained in:
Donne Martin
2015-08-16 08:23:26 -04:00
parent 6b269d0f45
commit 82b74ca7b4
1 changed files with 5 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
graphs_trees/graph_path_exists/path_exists_solution.ipynb
View File

@@ -71,7 +71,11 @@
"source": [
"## Algorithm\n",
"\n",
"We use breadth-first search to determine the shortest path. Depth-first search is easier to implement with just straight recursion, but often results in a longer path.\n",
"To determine if there is a path, we can use either breadth-first or depth-first search.\n",
"\n",
"Breadth-first search can also be used to determine the shortest path. Depth-first search is easier to implement with just straight recursion, but often results in a longer path.\n",
"\n",
"We'll use a breadth-first search approach:\n",
"\n",
"* Add the start node to the queue and mark it as visited\n",
"* If the start node is the end node, return True\n",