Expand description

Module for graph traversal algorithms.

Enums

A breadth first search (BFS) visitor event.
A depth first search (DFS) visitor event.
A dijkstra search visitor event.

Functions

An iterative breadth first search.
An iterative depth first search.
Return an edge list of the tree edges from a depth-first traversal.
Dijkstra traversal of a graph.