Module traversal 

Graph traversal algorithms

This module provides breadth-first search (BFS) and depth-first search (DFS) algorithms for both directed and undirected graphs.

Functions

bidirectional_search

Performs bidirectional breadth-first search to find a path between two nodes

bidirectional_search_digraph

Bidirectional search for directed graphs

breadth_first_search

Performs breadth-first search (BFS) from a given starting node

breadth_first_search_digraph

Performs breadth-first search (BFS) from a given starting node in a directed graph

depth_first_search

Performs depth-first search (DFS) from a given starting node

depth_first_search_digraph

Performs depth-first search (DFS) from a given starting node in a directed graph

priority_first_search

Performs priority-first search from a given starting node

priority_first_search_digraph

Performs priority-first search from a given starting node in a directed graph