data-structures-and-algorithms

Code challenge 36:

Graph-Breadth-First

• To write the following method for the Graph class:

  • breadth first
  • Arguments: Node
  • Return: A collection of nodes in the order they were visited.
  • Display the collection

Approach & Efficiency

• test result:

• Big O

  • Time <— O(n)
  • Space <—– O(n)