Optimal pathfinding through complex task workflows

Summary

This tool implements A* pathfinding to determine optimal task sequences through complex dependency graphs. It supports finding the K-shortest paths while allowing cost, time, or risk to be used as configurable heuristics.