🍈 Zettelkasten

Breadth First Search

1 min read

A Graph Traversal algorithm that searches in ‘rings’.

Algorithm

Top-down Programming

  1. Starts at vertex 0
  2. Save all previously visited nodes in a list
  3. Continue until there is no more adjacent nodes that have not been met

Graph View

Backlinks