fbp-evaluator

Evaluate Flow-Based Programming graphs with lazy node execution.

1|Updated Jan 20, 2026
One-click install
npx skills add https://github.com/constructive-io/constructive-skills --skill fbp-evaluator
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: fbp-evaluator
Source: https://github.com/constructive-io/constructive-skills/tree/main/skills/fbp-evaluator
Command: npx skills add https://github.com/constructive-io/constructive-skills --skill fbp-evaluator

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

This Skill provides an efficient way to evaluate complex Flow-Based Programming (FBP) graphs by only computing the necessary nodes for a given output.

Core Features & Use Cases

  • Lazy Evaluation: Optimizes performance by evaluating only required nodes.
  • Node Definition: Supports defining custom node logic with inputs, outputs, and implementations.
  • Use Case: Use this Skill to process data through a visual programming graph where only a specific final result is needed, avoiding unnecessary computations.

Quick Start

Evaluate the provided FBP graph to get the 'sum' output from the 'add' node.

Frequently Asked Questions about fbp-evaluator

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I evaluate a Flow-Based Programming graph efficiently?

You can evaluate Flow-Based Programming graphs using a lazy execution engine that only computes the nodes required for a specific output, avoiding unnecessary calculations.

What is lazy evaluation in dataflow computations?

Lazy evaluation in dataflow computations means the engine processes graph nodes based on output demand, executing only the paths necessary to produce the requested result.

How do I process specific outputs in an FBP graph without computing everything?

You can request a specific output from the graph, and the lazy evaluation engine will trace back and compute only the necessary nodes, leaving irrelevant paths unevaluated.

Does the FBP evaluator support custom node definitions with multiple inputs?

Yes, the evaluator supports defining custom node logic with multiple input ports and boundary nodes, allowing you to tailor dataflow computations to your specific graph architecture.

Can I use this for dynamic graph processing in TypeScript?

Yes, this Skill is designed for TypeScript environments and handles dynamic graph processing by evaluating dataflow computations through the @fbp/evaluator package.

When should I use lazy graph evaluation instead of full execution?

Use lazy graph evaluation when you need a specific final result from a complex visual programming graph, as it optimizes performance by skipping computations for unrequested outputs.