Skillget

genpark-temporal-plan-simple-temporal-network-stn-skill

mcp
Guvenlik Denetimi
Uyari
Health Uyari
  • No license — Repository has no license file
  • Description — Repository has a description
  • Active repo — Last push 0 days ago
  • Low visibility — Only 8 GitHub stars
Code Gecti
  • Code scan — Scanned 4 files during light audit, no dangerous patterns found
Permissions Gecti
  • Permissions — No dangerous permissions requested

Bu listing icin henuz AI raporu yok.

SUMMARY

GenPark AI Agent Skill - Simple Temporal Network (STN) constraint solver checking temporal consistency, calculating earliest/latest event bounds, and propagating deadlines via Floyd-Warshall.

README.md

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]

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

Yorumlar (0)

Sonuc bulunamadi