Description
Provides a monad transformer for weighted graph searches. It helps Haskell code express search problems where paths have costs and the best result depends on accumulated weights.
This is useful for routing, planning, dependency solving, game AI, and optimization problems. It is a programming library and not an interactive graph tool.