StarMirror/interactive-coding-challenges
1
0
Fork 0
mirror of https://github.com/donnemartin/interactive-coding-challenges.git synced 2024-03-22 13:11:13 +08:00
Code Issues Projects Releases Wiki Activity

Update graph bfs challenge

Browse Source 
Add more detail to algorithm space complexity.
This commit is contained in:
Donne Martin 2016-11-14 06:39:16 -05:00
parent 2d98b8a496
commit 9a321b9f15
1 changed files with 6 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
graphs_trees/graph_bfs/bfs_solution.ipynb
View File

@ -83,7 +83,12 @@
"\n", "\n",
"Complexity:\n", "Complexity:\n",
"* Time: O(V + E), where V = number of vertices and E = number of edges\n", "* Time: O(V + E), where V = number of vertices and E = number of edges\n",
"* Space: O(V + E)" "* Space: O(V)\n",
"\n",
"Note on space complexity from [Wikipedia](https://en.wikipedia.org/wiki/Breadth-first_search):\n",
"* When the number of vertices in the graph is known ahead of time, and additional data structures are used to determine which vertices have already been added to the queue, the space complexity can be expressed as O(V) \n",
"* If the graph is represented by an adjacency list it occupies O(V + E) space in memory\n",
"* If the graph is represented by an adjacency matrix representation, it occupies O(V^2)"
] ]
}, },
{ {