Breadth First Search

 

Overview

The breath-first algorithm was first developed by E. F. Moore in the 1950’s who first used it to find the shortest path through a maze.

Concept

Depth-first search is an algorithm for traversing a tree or graph data structure by starting at the root and continuing as far as possible along a branch before back tracking.

Algorithmic Complexity

Big-O

AlgorithmData StructureTime Complexity - AverageTime Complexity - WorstSpace Complexity - Worst
Breadth First SearchGraph of |V| vertices and |E| edges-O(|E|+|V|)O(|V|)

 

Implementation

Java Implementation

Coming soon!

References

Wikipedia: Breadth-first search
 

<- back