bfs – Breadth-First Search

bfs.breadth_first_kernel(graph, start)[source]

Breadth first iterator over graph.

Yields subseqent node identifiers from graph without repetitions.

Parameters:
  • graph – Adjacency list of graph
  • start – Start node identifier

Breadth first search for node identifier.

Yields node identifiers till node is located.

Parameters:
  • graph – Adjacency list of graph
  • start – Start node identifier
  • search – Search node identifier
Example:
>>> list(breadth_first_search({1: [2, 3], 2: [3, 5], 3: [4]}, 1, 4))
[1, 2, 3, 5, 4]