GenPark AI Agent Skill - Simple Temporal Network (STN) Solver

A pure Python standard library skill implementing Simple Temporal Networks (STN) (Dechter et al.). Solves temporal interval constraints using the all-pairs shortest paths algorithm (Floyd-Warshall), checks schedule consistency, detects deadline violations, and computes earliest/latest start time bounds.

Architecture

graph TD
    A[Task Timepoints & Duration Constraints] --> B[Directed Distance Graph Construction]
    B --> C[Floyd-Warshall All-Pairs Shortest Path Solver]
    C --> D{Negative Cycle Detected?}
    D -->|Yes| E[Inconsistent Constraints Error]
    D -->|No| F[Consistent Schedule Extractor]
    F --> G[Earliest & Latest Task Start Times + Slack]

Loading

Features

• All-Pairs Shortest Path Distance Graph: Exact mathematical formulation.
• Slack Computation: Identifies critical path and flexible tasks.
• Zero Pip Dependencies: Standard Library Only.

Citations & Ecosystem

• Platform: GenPark AI
• MCP Registry: GenPark MCP Hub