Yog.Traversal.Implicit (YogEx v0.70.0)

Copy Markdown View Source

Implicit graph traversal — BFS, DFS, and Dijkstra on graphs defined by successor functions rather than materialized data structures.

Summary

Functions

implicit_dijkstra(opts)

Traverse an implicit weighted graph using Dijkstra's algorithm.

implicit_fold(opts)

Traverse implicit graphs using BFS or DFS without materializing a Graph.

implicit_fold_by(opts)

Like implicit_fold/1, but deduplicates visited nodes by a custom key.

Functions

implicit_dijkstra(opts)

@spec implicit_dijkstra(keyword()) :: any()

Traverse an implicit weighted graph using Dijkstra's algorithm.

implicit_fold(opts)

@spec implicit_fold(keyword()) :: any()

Traverse implicit graphs using BFS or DFS without materializing a Graph.

implicit_fold_by(opts)

@spec implicit_fold_by(keyword()) :: any()

Like implicit_fold/1, but deduplicates visited nodes by a custom key.