Please enable JavaScript.
Coggle requires JavaScript to display documents.
Graphs, Depth-first search, Breadth-First Search, Topological Sorting -…
-
Depth-first search
-
-
-
The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking.
Breadth-First Search
-
-
-
finds shortest paths from a given source vertex to all other vertices, in terms of the number of edges in the paths.
-