π¦ ClawHub
Oraclaw Pathfind
by @whatsonyourmind
A* pathfinding and task sequencing for AI agents. Find the optimal path through workflows, dependencies, and decision trees. K-shortest paths via Yen's algor...
π Constraints
1. All edges are directed (AβB doesn't mean BβA unless you add both) 2. Edge costs must be non-negative (A* requires this) 3. K-shortest paths uses Yen's algorithm β set kPaths=1 for just the best path 4. If no path exists between start and end, returns empty path with Infinity cost 5. Risk values should be 0-1 probabilities; they're summed along the path
TERMINAL
clawhub install oraclaw-pathfind