Graph Search: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 1: | Line 1: | ||
=Internal= | =Internal= | ||
* [[Graphs#Subjects|Graphs]] | * [[Graphs#Subjects|Graphs]] | ||
=TO DEPLETE= | |||
{{Internal|Searching_a_Graph_and_Finding_a_Path_through_Graphs_TODEPLETE|Searching_a_Graph_and_Finding_a_Path_through_Graphs_TODEPLETE}} | |||
=Overview= | =Overview= | ||
Revision as of 21:38, 1 October 2021
Internal
TO DEPLETE
Overview
Both breadth-first search and depth-first search algorithms are very efficient, in that they walk the entire graph in linear time of the number of vertices and edges O(n + m).