rust-logic-graph 0.9.0

A modular reasoning graph framework with advanced control flow (subgraphs, conditionals, loops, error handling)
Documentation

๐Ÿง  Rust Logic Graph

Rust License: MIT GitHub CI

A high-performance reasoning graph framework for Rust with GRL (Grule Rule Language) support. Build complex workflows with conditional execution, topological ordering, and async processing.


โœจ Key Features

  • ๐Ÿ”ฅ GRL Support - rust-rule-engine v0.17
  • ๐Ÿ”„ Topological Execution - Automatic DAG-based node ordering
  • โšก Async Runtime - Built on Tokio for high concurrency
  • โšก Parallel Execution - Automatic parallel execution of independent nodes (v0.5.0)
  • ๐Ÿ’พ Caching Layer - High-performance result caching with TTL, eviction policies, and memory limits (v0.5.0)
  • ๐Ÿง  Memory Optimization - Context pooling and allocation tracking (v0.7.0)
  • ๐Ÿ› ๏ธ CLI Developer Tools - Graph validation, dry-run, profiling, and visualization (v0.5.0)
  • ๐ŸŽจ Web Graph Editor - Next.js visual editor with drag-and-drop interface (v0.8.0)
  • ๐Ÿ“‹ YAML Configuration - Declarative graph definitions with external config files (v0.8.5)
  • ๐ŸŽฏ Advanced Control Flow - Subgraphs, conditionals, loops, error handling (v0.9.0) ๐Ÿ†•
  • ๐Ÿ“Š Multiple Node Types - RuleNode, DBNode, AINode, ConditionalNode, LoopNode, TryCatchNode, RetryNode, CircuitBreakerNode
  • ๐Ÿ“ JSON/YAML Configuration - Simple workflow definitions
  • ๐ŸŽฏ 98% Drools Compatible - Easy migration from Java
  • ๐ŸŒŠ Streaming Processing - Stream-based execution with backpressure (v0.3.0)
  • ๐Ÿ—„๏ธ Database Integrations - PostgreSQL, MySQL, Redis, MongoDB (v0.2.0)
  • ๐Ÿค– AI/LLM Integrations - OpenAI, Claude, Ollama (v0.2.0)

๐Ÿš€ Quick Start

Installation

[dependencies]
rust-logic-graph = "0.9.0"

# With specific integrations
rust-logic-graph = { version = "0.9.0", features = ["postgres", "openai"] }

# With all integrations
rust-logic-graph = { version = "0.9.0", features = ["all-integrations"] }

๐Ÿข Real-World Case Study: Purchasing Flow System

See a complete production implementation in case_study/ - A full-featured purchasing automation system built with Rust Logic Graph.

๐Ÿ“Š System Overview

Problem: Automate purchasing decisions for inventory replenishment across multiple products, warehouses, and suppliers.

Solution: Business rules in GRL decide when/how much to order. Orchestrator executes the workflows.

๐ŸŽฏ Two Architecture Implementations

The purchasing flow system demonstrates the same business logic implemented in two different architectures - showcasing rust-logic-graph's flexibility for different deployment scenarios.

Architecture Comparison: Pros, Cons & Use Cases

Aspect ๐Ÿข Monolithic ๐ŸŒ Microservices
โœ… Advantages โ€ข Fast development - Single codebase, quick iterationsโ€ข Low latency - In-process calls (~10ms)โ€ข Simple deployment - Single binaryโ€ข Easy debugging - Single process, simple logsโ€ข Low cost - ~50MB RAM, 1 CPUโ€ข YAML flexibility - Change workflows without rebuild โ€ข Horizontal scaling - Scale services independentlyโ€ข Team autonomy - Separate service ownershipโ€ข Fault isolation - Service failure โ‰  system failureโ€ข Tech flexibility - Different languages per serviceโ€ข Independent deploys - Update without full restartโ€ข Production proven - Battle-tested at scale
โŒ Disadvantages โ€ข Vertical scaling only - Limited by single machineโ€ข Single point of failure - Process crash = full outageโ€ข Tight coupling - All code in one repoโ€ข Resource competition - Services share CPU/RAMโ€ข Deployment risk - One deploy affects everything โ€ข Network overhead - gRPC calls (~56ms, 5.6x slower)โ€ข Complex setup - Docker, K8s, service meshโ€ข High resource usage - ~500MB RAM, 7 containersโ€ข Debugging complexity - Distributed tracing neededโ€ข Development friction - Slower build/test cyclesโ€ข Infrastructure cost - More servers required
๐ŸŽฏ Best Use Cases โœ… Startups - MVP, validate quicklyโœ… Small teams (1-5 devs)โœ… Low-medium traffic (<1K req/min)โœ… Cost-sensitive projectsโœ… Frequent changes - Business logic evolvesโœ… Simple ops - Limited DevOps resources โœ… High scale (>10K req/min)โœ… Large teams (15+ devs, multiple teams)โœ… Critical uptime - 99.99% SLAโœ… Independent services - Different release cyclesโœ… Polyglot needs - Mix languages/frameworksโœ… Regulatory - Service isolation required
โš ๏ธ Anti-patterns โŒ Don't use if:โ€ข Need >10K requests/minโ€ข Team >15 developersโ€ข Services need independent scalingโ€ข Require 99.99% uptime โŒ Don't use if:โ€ข Team <5 developersโ€ข Traffic <1K requests/minโ€ข Premature optimizationโ€ข No DevOps expertise
๐Ÿ—๏ธ Architecture Single HTTP service (Port 8080)4 PostgreSQL DBs (multi-database)YAML-driven graph execution 7 services (gRPC + HTTP)4 PostgreSQL DBs (service-owned)Hardcoded gRPC graph topology
๐Ÿ“Š Performance ~10ms latency (in-process)~50MB RAM, 1 CPU core ~56ms latency (network calls)~500MB RAM, 7 containers

When to Use Each Architecture

โœ… Use Monolithic When:

  • ๐Ÿš€ Early stage startup - Fast iteration, quick deployments
  • ๐Ÿ’ฐ Limited resources - Small team, limited infrastructure budget
  • ๐Ÿ“Š Low-medium traffic - <1000 requests/minute
  • ๐ŸŽฏ MVP/Prototype - Need to validate business logic quickly
  • ๐Ÿ› ๏ธ Simple operations - Single deployment, easy monitoring
  • ๐Ÿ‘ฅ Small team - 1-5 developers, full-stack ownership
  • ๐Ÿ”ง Frequent changes - Business logic changes often, need flexibility
  • ๐Ÿ’ต Cost-sensitive - Minimize cloud costs, fewer resources

Monolithic Example (Port 8080):

cd case_study/monolithic
cargo run --release
curl -X POST http://localhost:8080/purchasing/flow \
  -H "Content-Type: application/json" \
  -d '{"product_id": "PROD-001"}'

โœ… Use Microservices When:

  • ๐Ÿ“ˆ High scale - >10,000 requests/minute, need horizontal scaling
  • ๐Ÿ‘ฅ Large team - Multiple teams, service ownership per team
  • ๐Ÿ”ง Independent deployments - Deploy services independently
  • ๐Ÿ›ก๏ธ Fault isolation - Service failure shouldn't crash entire system
  • ๐ŸŒ Polyglot needs - Different services in different languages
  • ๐Ÿ”„ Different SLAs - Critical services need higher availability
  • ๐Ÿ“Š Complex monitoring - Distributed tracing, service mesh
  • ๐Ÿ’ฐ Budget for infrastructure - Can afford Kubernetes, service mesh

Microservices Example (7 Services):

cd case_study/microservices
docker compose up -d
curl -X POST http://localhost:8080/api/purchasing/flow \
  -H "Content-Type: application/json" \
  -d '{"product_id": "PROD-001"}'

Migration Path: Start Monolithic โ†’ Scale to Microservices

  1. Phase 1: Start Monolithic

    • Build and validate business logic
    • Use YAML config for flexibility
    • Deploy single binary
  2. Phase 2: Extract Critical Services

    • Identify bottlenecks (e.g., Rule Engine)
    • Extract to separate service
    • Keep rest monolithic
  3. Phase 3: Full Microservices

    • Split all services when scale demands
    • Add service mesh, observability
    • Use Kubernetes for orchestration

Both implementations use:

  • โœ… Same GRL business rules (15 rules in purchasing_rules.grl)
  • โœ… Same graph topology (OMS โ†’ Inventory โ†’ Supplier โ†’ UOM โ†’ RuleEngine โ†’ PO)
  • โœ… rust-logic-graph's Graph/Executor pattern
  • โœ… Clean architecture principles

๐Ÿ”ฅ GRL Business Rules (15 Rules)

rule "CalculateShortage" salience 120 no-loop {
  when
    required_qty > 0
  then
    Log("Calculating shortage...");
    shortage = required_qty - available_qty;
    Log("Shortage calculated");
}

rule "OrderMOQWhenShortageIsLess" salience 110 no-loop {
  when
    shortage > 0 && shortage < moq && is_active == true
  then
    Log("Shortage less than MOQ, ordering MOQ");
    order_qty = moq;
}

See full rules: purchasing_rules.grl

YAML Configuration (NEW in v0.8.5)

Both Monolithic and Microservices implementations support YAML-based graph configuration, but with different approaches:

Monolithic YAML Example (purchasing_flow_graph.yaml):

nodes:
  oms_history:
    type: DBNode
    database: "oms_db"  # Multi-database routing
    query: "SELECT product_id, avg_daily_demand::float8, trend FROM oms_history WHERE product_id = $1"
  
  inventory_levels:
    type: DBNode
    database: "inventory_db"
    query: "SELECT product_id, available_qty::float8, reserved_qty::float8 FROM inventory WHERE product_id = $1"
  
  rule_engine:
    type: RuleNode
    description: "Evaluate business rules with dynamic field mapping"
    dependencies:
      - oms_history
      - inventory_levels
      - supplier_info
      - uom_conversion
    field_mappings:  # Dynamic field extraction (NEW)
      avg_daily_demand: "oms_history.avg_daily_demand"
      available_qty: "inventory_levels.available_qty"
      lead_time: "supplier_info.lead_time"
      moq: "supplier_info.moq"

  create_po:
    type: RuleNode
    dependencies:
      - rule_engine
    field_mappings:
      should_order: "rule_engine.should_order"
      recommended_qty: "rule_engine.recommended_qty"
      product_id: "supplier_info.product_id"

edges:
  - from: oms_history
    to: rule_engine
  - from: inventory_levels
    to: rule_engine
  - from: rule_engine
    to: create_po

Microservices YAML Example (purchasing_flow_graph.yaml):

nodes:
  oms_grpc:
    type: GrpcNode
    query: "http://localhost:50051#GetOrderHistory"
    description: "Fetch order management data via gRPC"
  
  inventory_grpc:
    type: GrpcNode
    query: "http://localhost:50052#GetInventoryLevels"
    description: "Fetch inventory levels via gRPC"
  
  supplier_grpc:
    type: GrpcNode
    query: "http://localhost:50053#GetSupplierInfo"
    description: "Fetch supplier information via gRPC"
  
  uom_grpc:
    type: GrpcNode
    query: "http://localhost:50054#ConvertUnits"
    description: "Fetch UOM conversions via gRPC"
  
  rule_engine_grpc:
    type: RuleNode
    description: "Evaluate business rules"
    dependencies:
      - oms_grpc
      - inventory_grpc
      - supplier_grpc
      - uom_grpc
  
  po_grpc:
    type: RuleNode
    description: "Create purchase order"
    dependencies:
      - rule_engine_grpc

edges:
  - from: oms_grpc
    to: rule_engine_grpc
  - from: inventory_grpc
    to: rule_engine_grpc
  - from: supplier_grpc
    to: rule_engine_grpc
  - from: uom_grpc
    to: rule_engine_grpc
  - from: rule_engine_grpc
    to: po_grpc

Key Differences:

Feature Monolithic YAML Microservices YAML
Node Type DBNode (direct SQL) GrpcNode (service calls)
Query SQL queries gRPC endpoint URLs
Database Routing database: "oms_db" No database (delegates to services)
Field Mappings โœ… Dynamic via YAML โŒ Hardcoded in Node implementations
Flexibility 100% config-driven Hybrid (topology in YAML, logic in code)

Benefits:

  • โœ… 70% less code - Graph definition moves from Rust to YAML
  • โœ… No recompile - Change workflows without rebuilding
  • โœ… Dynamic field mapping (Monolithic only) - Zero hardcoded field names
  • โœ… Multi-database routing (Monolithic only) - Each node specifies its database
  • โœ… Service URLs (Microservices only) - Configure gRPC endpoints
  • โœ… Better readability - Clear, declarative graph structure
  • โœ… Easy testing - Test with different configurations

Key Architecture Differences:

Aspect Monolithic Microservices
Service Count 1 service 7 services (Orchestrator, OMS, Inventory, Supplier, UOM, RuleEngine, PO)
Ports Single port 8080 Orchestrator: 8080, Services: 50051-50056 (gRPC)
Database Access Direct SQL queries to 4 DBs gRPC calls to service APIs
Field Mapping YAML field_mappings config Hardcoded in gRPC node implementations
Rule Engine In-process RuleEngine call gRPC to rule-engine-service :50055
Communication Function calls (0 network) gRPC (network overhead)
Graph Executor PurchasingGraphExecutor OrchestratorExecutor with gRPC nodes
Node Types DynamicDBNode, DynamicRuleNode OmsGrpcNode, InventoryGrpcNode, etc.
Configuration 100% YAML-driven Partially hardcoded gRPC contracts
Flexibility Change workflow via YAML only Need code changes for new services
Dependencies rust-logic-graph + sqlx rust-logic-graph + tonic + prost
Deployment cargo run or single binary docker compose up (11 containers)
Development Hot reload, fast compile Rebuild multiple containers
Production Ready โœ… Yes (single binary) โœ… Yes (Docker/K8s)

Example Response Time Comparison:

Monolithic (in-process):
โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
โ”‚ HTTP Request โ†’ Graph Executor       โ”‚ ~2ms
โ”‚ โ”œโ”€ DB Query (oms_db)                โ”‚ ~1ms
โ”‚ โ”œโ”€ DB Query (inventory_db)          โ”‚ ~1ms
โ”‚ โ”œโ”€ DB Query (supplier_db)           โ”‚ ~1ms
โ”‚ โ”œโ”€ DB Query (uom_db)                โ”‚ ~1ms
โ”‚ โ”œโ”€ Rule Engine (in-process)         โ”‚ ~2ms
โ”‚ โ””โ”€ Create PO (in-process)           โ”‚ ~2ms
โ”‚ Total: ~10ms                        โ”‚
โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜

Microservices (network calls):
โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
โ”‚ HTTP Request โ†’ Orchestrator         โ”‚ ~2ms
โ”‚ โ”œโ”€ gRPC OMS Service (50051)         โ”‚ ~8ms (network + DB)
โ”‚ โ”œโ”€ gRPC Inventory (50052)           โ”‚ ~8ms (network + DB)
โ”‚ โ”œโ”€ gRPC Supplier (50053)            โ”‚ ~8ms (network + DB)
โ”‚ โ”œโ”€ gRPC UOM (50054)                 โ”‚ ~8ms (network + DB)
โ”‚ โ”œโ”€ gRPC Rule Engine (50055)         โ”‚ ~12ms (network + rules)
โ”‚ โ””โ”€ gRPC PO Service (50056)          โ”‚ ~10ms (network + create)
โ”‚ Total: ~56ms (5.6x slower)          โ”‚
โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜

Trade-offs Summary:

Consideration Monolithic Wins Microservices Wins
Performance โœ… 5-10x faster โŒ Network overhead
Simplicity โœ… Single process โŒ Complex setup
Resource Usage โœ… ~50MB RAM โŒ ~500MB RAM
Development Speed โœ… Faster iteration โŒ Slower builds
Scalability โŒ Vertical only โœ… Horizontal scale
Team Autonomy โŒ Shared codebase โœ… Independent teams
Fault Isolation โŒ Single point of failure โœ… Service isolation
Deployment โœ… Single binary โŒ Multi-container
Monitoring โœ… Simple logs โŒ Distributed tracing
Cost โœ… Lower infra cost โŒ Higher infra cost

Real-World Recommendation:

Traffic Level          | Recommended Architecture
-----------------------|-------------------------
< 100 req/min          | Monolithic (overkill to use microservices)
100-1,000 req/min      | Monolithic (scales easily vertically)
1,000-10,000 req/min   | Monolithic or Hybrid (extract bottlenecks)
> 10,000 req/min       | Microservices (horizontal scaling needed)

Team Size              | Recommended Architecture
-----------------------|-------------------------
1-5 developers         | Monolithic (single codebase)
5-15 developers        | Monolithic or Hybrid
15-50 developers       | Microservices (team per service)
> 50 developers        | Microservices (clear boundaries)

Documentation: See YAML_CONFIGURATION_SUMMARY.md

Microservices Communication Flow

After v0.8.0 refactor, the Orchestrator now uses rust-logic-graph's Graph/Executor pattern to coordinate microservices:

  • The Orchestrator receives a purchasing request (HTTP) and creates a Graph with 6 custom gRPC Nodes.
  • Each Node wraps a gRPC call to a service: OmsGrpcNode, InventoryGrpcNode, SupplierGrpcNode, UomGrpcNode, RuleEngineGrpcNode, PoGrpcNode.
  • The Executor runs the graph in topological order:
    1. Data Collection Phase (parallel): OMS, Inventory, Supplier, UOM nodes execute simultaneously via gRPC
    2. Rule Evaluation Phase: RuleEngineGrpcNode waits for all data, then evaluates GRL rules
    3. Execution Phase: PoGrpcNode creates/sends PO based on rule decisions
  • All business logic (decision flags, calculations) comes from GRL rules. The Orchestrator is a pure executor.

Graph Topology:

OMS Node โ”€โ”€โ”€โ”€โ”
             โ”‚
Inventory โ”€โ”€โ”€โ”ผโ”€โ”€โ†’ RuleEngine Node โ”€โ”€โ†’ PO Node
             โ”‚
Supplier โ”€โ”€โ”€โ”€โ”ค
             โ”‚
UOM Node โ”€โ”€โ”€โ”€โ”˜

Benefits of Graph/Executor Pattern:

  • โœ… Declarative: Define workflow as nodes + edges instead of imperative code
  • โœ… Parallel Execution: Data nodes run concurrently automatically
  • โœ… Type Safety: Custom Node implementations with Rust's type system
  • โœ… Testable: Each node can be tested in isolation
  • โœ… Consistent: Same pattern used in monolithic and microservices
โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
โ”‚                         CLIENT (HTTP REST)                          โ”‚
โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
                                 โ”‚ POST /api/purchasing/flow
                                 โ–ผ
        โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
        โ”‚      Orchestrator Service (Port 8080) - main.rs            โ”‚
        โ”‚                                                            โ”‚
        โ”‚  HTTP Endpoint โ†’ OrchestratorGraphExecutor                 โ”‚
        โ”‚                                                            โ”‚
        โ”‚  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”  โ”‚
        โ”‚  โ”‚    rust-logic-graph Graph Executor                   โ”‚  โ”‚
        โ”‚  โ”‚    (graph_executor.rs)                               โ”‚  โ”‚
        โ”‚  โ”‚                                                      โ”‚  โ”‚
        โ”‚  โ”‚  Creates Graph with 6 Custom gRPC Nodes:             โ”‚  โ”‚
        โ”‚  โ”‚  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”  โ”‚  โ”‚
        โ”‚  โ”‚  โ”‚ OmsGrpcNode                                    โ”‚  โ”‚  โ”‚
        โ”‚  โ”‚  โ”‚ โ€ข impl Node trait from rust-logic-graph        โ”‚  โ”‚  โ”‚
        โ”‚  โ”‚  โ”‚ โ€ข async fn run() โ†’ gRPC call to :50051         โ”‚  โ”‚  โ”‚
        โ”‚  โ”‚  โ”‚ โ€ข Returns JSON to Context                      โ”‚  โ”‚  โ”‚
        โ”‚  โ”‚  โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜  โ”‚  โ”‚
        โ”‚  โ”‚  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”  โ”‚  โ”‚
        โ”‚  โ”‚  โ”‚ InventoryGrpcNode โ†’ gRPC :50052                โ”‚  โ”‚  โ”‚
        โ”‚  โ”‚  โ”‚ SupplierGrpcNode โ†’ gRPC :50053                 โ”‚  โ”‚  โ”‚
        โ”‚  โ”‚  โ”‚ UomGrpcNode โ†’ gRPC :50054                      โ”‚  โ”‚  โ”‚
        โ”‚  โ”‚  โ”‚ RuleEngineGrpcNode โ†’ gRPC :50056               โ”‚  โ”‚  โ”‚
        โ”‚  โ”‚  โ”‚ PoGrpcNode โ†’ gRPC :50055                       โ”‚  โ”‚  โ”‚
        โ”‚  โ”‚  โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜  โ”‚  โ”‚
        โ”‚  โ”‚                                                      โ”‚  โ”‚
        โ”‚  โ”‚  Graph Topology (hardcoded in graph_executor.rs):    โ”‚  โ”‚
        โ”‚  โ”‚  OMS โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”                                        โ”‚  โ”‚
        โ”‚  โ”‚  Inventory โ”€โ”ผโ”€โ†’ RuleEngine โ”€โ”€โ†’ PO                    โ”‚  โ”‚
        โ”‚  โ”‚  Supplier โ”€โ”€โ”ค                                        โ”‚  โ”‚
        โ”‚  โ”‚  UOM โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜                                        โ”‚  โ”‚
        โ”‚  โ”‚                                                      โ”‚  โ”‚
        โ”‚  โ”‚  Executor runs in topological order                  โ”‚  โ”‚
        โ”‚  โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜  โ”‚
        โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
                 โ”‚
   โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ผโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
   โ”‚ (Parallel)  โ”‚  (Parallel)      โ”‚   (Parallel)   โ”‚  (Parallel)  โ”‚
   โ–ผ             โ–ผ                  โ–ผ                โ–ผ              โ”‚
โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”        โ”‚
โ”‚OMS :50051โ”‚  โ”‚Inventory   โ”‚  โ”‚Supplier     โ”‚  โ”‚UOM :50054 โ”‚        โ”‚
โ”‚  (gRPC)  โ”‚  โ”‚:50052      โ”‚  โ”‚:50053       โ”‚  โ”‚  (gRPC)   โ”‚        โ”‚
โ”‚          โ”‚  โ”‚ (gRPC)     โ”‚  โ”‚ (gRPC)      โ”‚  โ”‚           โ”‚        โ”‚
โ”‚โ€ข History โ”‚  โ”‚โ€ข Levels    โ”‚  โ”‚โ€ข Pricing    โ”‚  โ”‚โ€ข Convert  โ”‚        โ”‚
โ”‚โ€ข Demand  โ”‚  โ”‚โ€ข Available โ”‚  โ”‚โ€ข Lead Time  โ”‚  โ”‚โ€ข Factors  โ”‚        โ”‚
โ”‚          โ”‚  โ”‚            โ”‚  โ”‚โ€ข MOQ        โ”‚  โ”‚           โ”‚        โ”‚
โ””โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”˜  โ””โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”˜  โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”˜  โ””โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”˜        โ”‚
     โ”‚              โ”‚                โ”‚               โ”‚              โ”‚
     โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ดโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ดโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜              โ”‚
                          โ”‚                                         โ”‚
                          โ”‚ Data stored in Graph Context            โ”‚
                          โ–ผ                                         โ”‚
                   โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”                              โ”‚
                   โ”‚ Rule Engine     โ”‚ (Port 50056 - gRPC)          โ”‚
                   โ”‚     :50056      โ”‚                              โ”‚
                   โ”‚   (gRPC)        โ”‚                              โ”‚
                   โ”‚                 โ”‚                              โ”‚
                   โ”‚ โ€ข Loads GRL     โ”‚ โ€ข Evaluates 15 rules         โ”‚
                   โ”‚   rules from    โ”‚ โ€ข Returns decision flags     โ”‚
                   โ”‚   .grl file     โ”‚ โ€ข NO side effects            โ”‚
                   โ”‚ โ€ข Pure function โ”‚ โ€ข Calculations + flags       โ”‚
                   โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜                              โ”‚
                            โ”‚                                       โ”‚
                            โ”‚ Flags stored in Graph Context         โ”‚
                            โ–ผ                                       โ”‚
                   โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”                              โ”‚
                   โ”‚ PO Service      โ”‚ (Port 50055 - gRPC)          โ”‚
                   โ”‚    :50055       โ”‚โ—„โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
                   โ”‚   (gRPC)        โ”‚
                   โ”‚                 โ”‚
                   โ”‚ โ€ข Create PO     โ”‚ โ€ข Reads flags from context
                   โ”‚ โ€ข Send to       โ”‚ โ€ข Executes based on rules
                   โ”‚   Supplier      โ”‚ โ€ข Email/API delivery
                   โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜

Note: The Orchestrator uses rust-logic-graph's Graph/Executor pattern - each gRPC service call is wrapped in a custom Node implementation. The Rule Engine returns decision flags to the Graph Context, and the PoGrpcNode reads these flags to determine whether to create/send the PO.

Where rust-logic-graph is Used

Monolithic App (case_study/monolithic/):

  • Uses Graph, Executor, and custom Node implementations
  • Multi-database architecture: 4 separate PostgreSQL databases (oms_db, inventory_db, supplier_db, uom_db)
  • Dynamic field mapping: YAML-configured field extraction with zero hardcoded field names
  • Config-driven nodes: DynamicDBNode and DynamicRuleNode read behavior from YAML
  • Database routing via database field in YAML (e.g., database: "oms_db")
  • Field mappings via field_mappings in YAML (e.g., avg_daily_demand: "oms_history.avg_daily_demand")
  • RuleEngineService accepts HashMap<String, Value> for complete flexibility
  • Graph structure defined in purchasing_flow_graph.yaml
  • Single process, no network calls

Orchestrator Microservice (case_study/microservices/services/orchestrator-service/):

  • Uses Graph, Executor, and custom gRPC Node implementations
  • 6 gRPC nodes make network calls to remote services
  • Same graph topology as monolithic
  • Distributed across multiple processes

Rule Engine Service (case_study/microservices/services/rule-engine-service/):

  • Uses RuleEngine for GRL evaluation
  • Exposed via gRPC endpoint
  • Stateless service (no graph execution)

Other Microservices (OMS, Inventory, Supplier, UOM, PO):

  • Standard gRPC services with database access
  • Do NOT use rust-logic-graph directly
  • Called by Orchestrator's Graph Executor

Architecture Highlights:

Monolithic Clean Architecture:

โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
โ”‚                   HTTP REST API (Port 8080)                             โ”‚
โ”‚                 POST /purchasing/flow {product_id}                      โ”‚
โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
                                   โ”‚
                                   โ–ผ
        โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
        โ”‚        PurchasingGraphExecutor (executors/graph_executor.rs)  โ”‚
        โ”‚                      (Clean Architecture)                      โ”‚
        โ”‚  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”  โ”‚
        โ”‚  โ”‚      rust-logic-graph Graph/Executor Engine              โ”‚  โ”‚
        โ”‚  โ”‚                                                          โ”‚  โ”‚
        โ”‚  โ”‚  execute_with_config(product_id, "purchasing_flow.yaml") โ”‚  โ”‚
        โ”‚  โ”‚                                                          โ”‚  โ”‚
        โ”‚  โ”‚  1. GraphConfig::from_yaml_file("purchasing_flow.yaml")  โ”‚  โ”‚
        โ”‚  โ”‚  2. Parse nodes + edges + field_mappings                 โ”‚  โ”‚
        โ”‚  โ”‚  3. For each node in YAML:                               โ”‚  โ”‚
        โ”‚  โ”‚     โ€ข Create DynamicDBNode (with database routing)       โ”‚  โ”‚
        โ”‚  โ”‚     โ€ข Create DynamicRuleNode (with field_mappings)       โ”‚  โ”‚
        โ”‚  โ”‚  4. Register all nodes to Executor                       โ”‚  โ”‚
        โ”‚  โ”‚  5. Execute graph in topological order                   โ”‚  โ”‚
        โ”‚  โ”‚                                                          โ”‚  โ”‚
        โ”‚  โ”‚  Graph Topology (from YAML):                             โ”‚  โ”‚
        โ”‚  โ”‚  oms_history โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”                                   โ”‚  โ”‚
        โ”‚  โ”‚  inventory_levels โ”€โ”€โ”€โ”ผโ”€โ”€โ†’ rule_engine โ”€โ”€โ†’ create_po      โ”‚  โ”‚
        โ”‚  โ”‚  supplier_info โ”€โ”€โ”€โ”€โ”€โ”€โ”ค                                   โ”‚  โ”‚
        โ”‚  โ”‚  uom_conversion โ”€โ”€โ”€โ”€โ”€โ”˜                                   โ”‚  โ”‚
        โ”‚  โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜  โ”‚
        โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
                       โ”‚
    โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ผโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
    โ”‚ (Parallel DBs)   โ”‚  (Parallel DBs)  โ”‚  (Parallel DBs)  โ”‚ (Parallel)โ”‚
    โ–ผ                  โ–ผ                  โ–ผ                  โ–ผ           โ”‚
โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”   โ”‚
โ”‚  oms_db      โ”‚  โ”‚ inventory_db โ”‚  โ”‚ supplier_db  โ”‚  โ”‚   uom_db     โ”‚   โ”‚
โ”‚ PostgreSQL   โ”‚  โ”‚ PostgreSQL   โ”‚  โ”‚ PostgreSQL   โ”‚  โ”‚ PostgreSQL   โ”‚   โ”‚
โ”‚  :5433       โ”‚  โ”‚  :5434       โ”‚  โ”‚  :5435       โ”‚  โ”‚  :5436       โ”‚   โ”‚
โ”‚              โ”‚  โ”‚              โ”‚  โ”‚              โ”‚  โ”‚              โ”‚   โ”‚
โ”‚ โ€ข history    โ”‚  โ”‚ โ€ข levels     โ”‚  โ”‚ โ€ข info       โ”‚  โ”‚ โ€ข conversion โ”‚   โ”‚
โ”‚ โ€ข demand     โ”‚  โ”‚ โ€ข available  โ”‚  โ”‚ โ€ข pricing    โ”‚  โ”‚ โ€ข factors    โ”‚   โ”‚
โ”‚ โ€ข trends     โ”‚  โ”‚ โ€ข reserved   โ”‚  โ”‚ โ€ข lead_time  โ”‚  โ”‚              โ”‚   โ”‚
โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜  โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜  โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜  โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜   โ”‚
       โ”‚                 โ”‚                 โ”‚                 โ”‚           โ”‚
       โ”‚ DynamicDBNode   โ”‚ DynamicDBNode   โ”‚ DynamicDBNode   โ”‚ Dynamic   โ”‚
       โ”‚ database:"oms"  โ”‚ database:"inv"  โ”‚ database:"sup"  โ”‚ DB Node   โ”‚
       โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ดโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ดโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ดโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
                                    โ”‚
                         Data stored in Graph Context
                         with path notation (e.g., "oms_history.avg_daily_demand")
                                    โ”‚
                                    โ–ผ
                  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
                  โ”‚        DynamicRuleNode (rule_engine)     โ”‚
                  โ”‚                                          โ”‚
                  โ”‚  YAML field_mappings config:             โ”‚
                  โ”‚  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”  โ”‚
                  โ”‚  โ”‚ avg_daily_demand:                  โ”‚  โ”‚
                  โ”‚  โ”‚   "oms_history.avg_daily_demand"   โ”‚  โ”‚
                  โ”‚  โ”‚ available_qty:                     โ”‚  โ”‚
                  โ”‚  โ”‚   "inventory_levels.available_qty" โ”‚  โ”‚
                  โ”‚  โ”‚ lead_time:                         โ”‚  โ”‚
                  โ”‚  โ”‚   "supplier_info.lead_time"        โ”‚  โ”‚
                  โ”‚  โ”‚ ... (9 total mappings)             โ”‚  โ”‚
                  โ”‚  โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜  โ”‚
                  โ”‚                                          โ”‚
                  โ”‚  extract_rule_inputs() loop:             โ”‚
                  โ”‚  โ€ข Reads field_mappings from YAML        โ”‚
                  โ”‚  โ€ข Uses get_value_by_path() for parsing  โ”‚
                  โ”‚  โ€ข Returns HashMap<String, Value>        โ”‚
                  โ”‚  โ€ข ZERO hardcoded field names!           โ”‚
                  โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
                                 โ”‚
                                 โ–ผ
                  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
                  โ”‚      RuleEngineService (In-Process)      โ”‚
                  โ”‚                                          โ”‚
                  โ”‚  evaluate(HashMap<String, Value>)        โ”‚
                  โ”‚                                          โ”‚
                  โ”‚  โ€ข Loads purchasing_rules.grl            โ”‚
                  โ”‚  โ€ข 15 business rules (GRL)               โ”‚
                  โ”‚  โ€ข Accepts dynamic HashMap input         โ”‚
                  โ”‚  โ€ข No struct, no hardcoded fields        โ”‚
                  โ”‚  โ€ข Pure functional evaluation            โ”‚
                  โ”‚                                          โ”‚
                  โ”‚  Rules calculate:                        โ”‚
                  โ”‚  โœ“ shortage = required_qty - available   โ”‚
                  โ”‚  โœ“ order_qty (respects MOQ)              โ”‚
                  โ”‚  โœ“ total_amount with discounts           โ”‚
                  โ”‚  โœ“ requires_approval flag                โ”‚
                  โ”‚  โœ“ should_create_po flag                 โ”‚
                  โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
                                 โ”‚
                      Decision flags returned to Context
                                 โ”‚
                                 โ–ผ
                  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
                  โ”‚    DynamicRuleNode (create_po)           โ”‚
                  โ”‚                                          โ”‚
                  โ”‚  YAML field_mappings config:             โ”‚
                  โ”‚  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”  โ”‚
                  โ”‚  โ”‚ should_order:                      โ”‚  โ”‚
                  โ”‚  โ”‚   "rule_engine.should_order"       โ”‚  โ”‚
                  โ”‚  โ”‚ recommended_qty:                   โ”‚  โ”‚
                  โ”‚  โ”‚   "rule_engine.recommended_qty"    โ”‚  โ”‚
                  โ”‚  โ”‚ product_id:                        โ”‚  โ”‚
                  โ”‚  โ”‚   "supplier_info.product_id"       โ”‚  โ”‚
                  โ”‚  โ”‚ ... (6 total mappings)             โ”‚  โ”‚
                  โ”‚  โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜  โ”‚
                  โ”‚                                          โ”‚
                  โ”‚  โ€ข Reads rule_engine output from context โ”‚
                  โ”‚  โ€ข Dynamic field extraction via YAML     โ”‚
                  โ”‚  โ€ข Creates PO if should_order == true    โ”‚
                  โ”‚  โ€ข Returns PO JSON or null               โ”‚
                  โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜

Key Design Principles:

  1. Multi-Database Routing - Each node specifies its database in YAML:

    oms_history:
      database: "oms_db"  # Routes to oms_db pool
    
  2. Dynamic Field Mapping - Zero hardcoded fields in Rust code:

    field_mappings:
      avg_daily_demand: "oms_history.avg_daily_demand"
    
    // Code is 100% generic
    for (key, path) in &self.field_mappings {
        inputs.insert(key.clone(), get_value_by_path(ctx, path));
    }
    
  3. Config-Driven Execution - Graph structure in YAML, not Rust:

    executor.execute_with_config("PROD-001", "purchasing_flow_graph.yaml")?;
    
  4. HashMap-Based RuleEngine - Accepts any fields:

    pub fn evaluate(&mut self, inputs: HashMap<String, Value>) -> Result<Output>
    

Microservices Communication Flow

  1. Multi-Database Routing (graph_executor.rs):
// YAML config specifies database per node
oms_history:
  database: "oms_db"
  query: "SELECT ..."

// Executor routes to correct pool
let pool = self.get_pool(node_config.database.as_deref());
  1. Dynamic Field Mapping (graph_executor.rs):
// YAML config defines field mappings
field_mappings:
  avg_daily_demand: "oms_history.avg_daily_demand"
  available_qty: "inventory_levels.available_qty"

// Code extracts dynamically (zero hardcoding)
fn extract_inputs(&self, ctx: &Context) -> HashMap<String, Value> {
    for (key, path) in &self.field_mappings {
        if let Some(value) = self.get_value_by_path(ctx, path) {
            inputs.insert(key.clone(), value);
        }
    }
}
  1. Config-Driven RuleEngine (rule_service.rs):
// Accepts HashMap instead of struct - 100% flexible
pub fn evaluate(&mut self, inputs: HashMap<String, Value>) -> Result<Output> {
    // Uses any fields present in HashMap
    // No hardcoded field requirements
}

Web Graph Editor (NEW in v0.8.0)

๐ŸŒ Online Editor: https://logic-graph-editor.amalthea.cloud/

Try the visual graph editor online - no installation required! Create workflows, define rules, and visualize your logic graphs with drag-and-drop.

CLI Tools (v0.5.0)

# Build the CLI tool
cargo build --release --bin rlg

# Validate a graph
./target/release/rlg validate --file examples/sample_graph.json

# Visualize graph structure
./target/release/rlg visualize --file examples/sample_graph.json --details

# Profile performance
./target/release/rlg profile --file examples/sample_graph.json --iterations 100

# Dry-run without execution
./target/release/rlg dry-run --file examples/sample_graph.json --verbose

Full CLI Documentation โ†’

Run Examples

# Basic workflow
cargo run --example simple_flow

# GRL rules
cargo run --example grl_rules

# Advanced integration
cargo run --example grl_graph_flow

Advanced Control Flow Usage (v0.9.0) ๐Ÿ†•

Conditional Branching

Route execution based on conditions:

use rust_logic_graph::{Graph, NodeConfig, Edge, Context};

let mut graph = Graph::new();

// Add nodes
graph.add_node("check_inventory", NodeConfig::default());
graph.add_node("process_order", NodeConfig::default());
graph.add_node("notify_supplier", NodeConfig::default());

// Add conditional routing
graph.add_node("route_decision", NodeConfig {
    node_type: NodeType::Conditional {
        condition: "available_qty > 100".to_string(),
        true_branch: "process_order".to_string(),
        false_branch: "notify_supplier".to_string(),
    },
    ..Default::default()
});

graph.add_edge(Edge::new("check_inventory", "route_decision"));
graph.add_edge(Edge::new("route_decision", "process_order"));
graph.add_edge(Edge::new("route_decision", "notify_supplier"));

// Execute
let result = graph.execute().await?;

Loops

Iterate over collections or use while loops:

// Foreach loop over products
graph.add_node("process_products", NodeConfig {
    node_type: NodeType::Loop {
        loop_type: LoopType::Foreach {
            items_key: "products".to_string(),
            item_var: "current_product".to_string(),
            body_node: "process_single_product".to_string(),
        },
        max_iterations: Some(100),
    },
    ..Default::default()
});

// While loop with condition
graph.add_node("retry_until_success", NodeConfig {
    node_type: NodeType::Loop {
        loop_type: LoopType::While {
            condition: "status != 'success'".to_string(),
            body_node: "attempt_operation".to_string(),
        },
        max_iterations: Some(10),
    },
    ..Default::default()
});

Error Handling

Try/catch patterns for resilient workflows:

graph.add_node("safe_operation", NodeConfig {
    node_type: NodeType::TryCatch {
        try_node: "risky_operation".to_string(),
        catch_node: Some("handle_error".to_string()),
        finally_node: Some("cleanup".to_string()),
    },
    ..Default::default()
});

Retry Logic

Exponential backoff for transient failures:

graph.add_node("api_call", NodeConfig {
    node_type: NodeType::Retry {
        target_node: "external_api".to_string(),
        max_attempts: 3,
        backoff_ms: 100,
        exponential: true,
    },
    ..Default::default()
});

Circuit Breaker

Fault tolerance for unstable services:

graph.add_node("protected_service", NodeConfig {
    node_type: NodeType::CircuitBreaker {
        target_node: "unstable_service".to_string(),
        failure_threshold: 5,
        timeout_ms: 60000,
    },
    ..Default::default()
});

Subgraphs

Nested graph execution with input/output mapping:

graph.add_node("payment_flow", NodeConfig {
    node_type: NodeType::Subgraph {
        graph_def: payment_graph_def,
        input_mapping: vec![("order_id", "id"), ("amount", "total")],
        output_key: "payment_result".to_string(),
    },
    ..Default::default()
});

See examples/ for complete working examples.



๐Ÿ“š Documentation

Document Description
๐Ÿข Case Study: Purchasing Flow Real production system with microservices & monolithic implementations
๐Ÿ“‹ YAML Configuration Guide Declarative graph configuration with YAML (NEW in v0.8.5)
Graph Editor Guide Visual web-based graph editor with Next.js (NEW in v0.8.0)
Memory Optimization Guide Context pooling and allocation tracking (v0.7.0)
CLI Tool Guide Developer tools for validation, profiling, and visualization (v0.5.0)
Cache Guide Caching layer with TTL and eviction policies (v0.5.0)
Migration Guide Upgrade guide to v0.14.0 with RETE-UL (v0.5.0)
Integrations Guide Database & AI integrations (v0.2.0)
GRL Guide Complete GRL syntax and examples
Use Cases 33+ real-world applications
Extending Create custom nodes and integrations
Implementation Technical details

๐ŸŽฏ Use Cases

Rust Logic Graph powers applications in:

  • ๐Ÿ’ฐ Finance - Loan approval, fraud detection, risk assessment
  • ๐Ÿ›’ E-commerce - Dynamic pricing, recommendations, fulfillment
  • ๐Ÿฅ Healthcare - Patient triage, clinical decisions, monitoring
  • ๐Ÿญ Manufacturing - Predictive maintenance, QC automation
  • ๐Ÿ›ก๏ธ Insurance - Claims processing, underwriting
  • ๐Ÿ“Š Marketing - Lead scoring, campaign optimization
  • โš–๏ธ Compliance - AML monitoring, GDPR automation

View all 33+ use cases โ†’


๐Ÿ—๏ธ Architecture

Rust Logic Graph architecture diagram


๐Ÿ”ฅ GRL Example

rule "HighValueLoan" salience 100 {
    when
        loan_amount > 100000 &&
        credit_score < 750
    then
        requires_manual_review = true;
        approval_tier = "senior";
}

rule "AutoApproval" salience 50 {
    when
        credit_score >= 700 &&
        income >= loan_amount * 3 &&
        debt_ratio < 0.4
    then
        auto_approve = true;
        interest_rate = 3.5;
}

Learn more about GRL โ†’


๐Ÿ“Š Performance

  • RETE-UL Algorithm: Advanced pattern matching with unlinking (v0.14.0)
  • 2-24x Faster: Than v0.10 at 50+ rules
  • 98% Drools Compatible: Easy migration path
  • Async by Default: High concurrency support
  • Parallel Execution: Automatic layer-based parallelism
  • Smart Caching: Result caching with TTL and eviction policies

๐Ÿงช Testing & CLI Tools

# Run all tests
cargo test

# Build CLI tool
cargo build --release --bin rlg

# Validate graph
./target/release/rlg validate --file examples/sample_graph.json

# Visualize graph structure
./target/release/rlg visualize --file examples/sample_graph.json

# Profile performance
./target/release/rlg profile --file examples/sample_graph.json --iterations 100

# Dry-run execution
./target/release/rlg dry-run --file examples/sample_graph.json --verbose

Test Results: โœ… 32/32 tests passing

Learn more about CLI tools โ†’


๐Ÿ“ฆ Project Status

Version: 0.8.8 (Latest) Status: Production-ready with YAML configuration, web graph editor, and real-world case study

What's Working

  • โœ… Core graph execution engine
  • โœ… RETE-UL algorithm (v0.14.0) - 2-24x faster
  • โœ… Three node types (Rule, DB, AI)
  • โœ… Topological sorting
  • โœ… Async execution
  • โœ… JSON I/O
  • โœ… Database integrations (PostgreSQL, MySQL, Redis, MongoDB)
  • โœ… AI integrations (OpenAI, Claude, Ollama)
  • โœ… Streaming processing with backpressure and chunking
  • โœ… Parallel execution with automatic layer detection
  • โœ… Caching layer with TTL, eviction policies, memory limits (v0.5.0)
  • โœ… Memory optimization with context pooling (v0.7.0)
  • โœ… CLI Developer Tools - validate, profile, visualize, dry-run (v0.5.0)
  • โœ… Web Graph Editor - Next.js visual editor with drag-and-drop (v0.8.0)
  • โœ… Production Case Study - Purchasing flow with microservices & monolithic (v0.8.0)
  • โœ… YAML Configuration - Declarative graph definitions (v0.8.5)
  • โœ… Stream operators (map, filter, fold)
  • โœ… Comprehensive documentation

Roadmap

  • Streaming processing (v0.3.0) - COMPLETED โœ…
  • Parallel node execution (v0.4.0) - COMPLETED โœ…
  • Caching layer (v0.5.0) - COMPLETED โœ…
  • CLI Developer Tools (v0.5.0) - COMPLETED โœ…
  • RETE-UL upgrade (v0.5.0) - COMPLETED โœ…
  • Memory Optimization (v0.7.0) - COMPLETED โœ…
  • Web Graph Editor (v0.8.0) - COMPLETED โœ…
  • Production Case Study (v0.8.0) - COMPLETED โœ…
  • YAML Configuration (v0.8.5) - COMPLETED โœ…
  • GraphQL API (v0.9.0)
  • Production release (v1.0.0)

See ROADMAP.md for details


๐Ÿค Contributing

Contributions welcome! Please:

  1. Fork the repository
  2. Create your feature branch
  3. Write tests for new features
  4. Submit a pull request

๐Ÿ“– Examples

Core Examples

Example Description Lines
simple_flow.rs Basic 3-node pipeline 36
advanced_flow.rs Complex 6-node workflow 120
grl_rules.rs GRL rule examples 110
grl_graph_flow.rs GRL + Graph integration 140
postgres_flow.rs PostgreSQL integration 100
openai_flow.rs OpenAI GPT integration 150
streaming_flow.rs Streaming with backpressure 200
parallel_execution.rs Parallel node execution 250

Advanced Control Flow Examples (v0.9.0) ๐Ÿ†•

Example Description Features Demonstrated
conditional_flow.rs If/else routing based on conditions ConditionalNode, branch selection
loop_flow.rs Foreach and while loop patterns LoopNode, iteration over arrays
retry_flow.rs Exponential backoff retry logic RetryNode, configurable attempts
error_handling_flow.rs Try/catch/finally patterns TryCatchNode, error recovery
circuit_breaker_flow.rs Circuit breaker fault tolerance CircuitBreakerNode, failure thresholds
subgraph_flow.rs Nested graph execution SubgraphNode, input/output mapping

Run examples:

# Conditional routing
cargo run --example conditional_flow

# Loop over products
cargo run --example loop_flow

# Retry with backoff
cargo run --example retry_flow

# Error handling
cargo run --example error_handling_flow

# Circuit breaker
cargo run --example circuit_breaker_flow

# Nested subgraphs
cargo run --example subgraph_flow

CLI Tool Examples (v0.5.0)

File Description
examples/sample_graph.json Linear workflow with 5 nodes
examples/cyclic_graph.json Graph with cycle for testing
examples/sample_context.json Sample input data

See CLI_TOOL.md for usage examples


๐ŸŒŸ Why Rust Logic Graph?

vs. Traditional Rule Engines

  • โœ… Async by default - No blocking I/O
  • โœ… Type safety - Rust's type system
  • โœ… Modern syntax - GRL support
  • โœ… Graph-based - Complex workflows

vs. Workflow Engines

  • โœ… Embedded - No external services
  • โœ… Fast - Compiled Rust code
  • โœ… Flexible - Custom nodes
  • โœ… Rule-based - Business logic in rules

๐Ÿ“ Changelog

v0.8.9 (2025-11-22) - DBNode Parameters Feature

New Features:

  • ๐Ÿ”ง DBNode Context Parameters - Dynamic query parameter extraction
    • Extract SQL parameters from execution context
    • NodeConfig::db_node_with_params() for parameterized queries
    • Support for $1, $2 (PostgreSQL) and ? (MySQL) placeholders
    • Automatic type conversion (String, Number, Boolean, Null)
    • Graceful handling of missing parameters
    • See DB Parameters Guide

API Additions:

// Create DBNode with context parameter extraction
NodeConfig::db_node_with_params(
    "SELECT * FROM users WHERE id = $1",
    vec!["user_id".to_string()]
)

// Set parameters in context
graph.context.set("user_id", json!("USER-123"));

Configuration Support:

nodes:
  fetch_user:
    node_type: DBNode
    query: "SELECT * FROM users WHERE user_id = $1"
    params:
      - user_id  # Extract from context

Testing:

  • 7 new integration tests in tests/db_params_tests.rs
  • Single/multiple parameter extraction
  • Missing parameter handling
  • Type conversion tests
  • JSON/YAML serialization tests

Documentation:

  • Complete guide in docs/DB_PARAMS.md
  • Example: examples/db_params_flow.rs
  • JSON example: examples/db_params_graph.json

Compatibility:

  • Fully backward compatible
  • Existing DBNodes work without changes
  • Optional feature (params default to None)

v0.8.5 (2025-11-20) - YAML Configuration Release

New Features:

  • ๐Ÿ“‹ YAML Configuration Support - Declarative graph definitions
    • Load graph structure from YAML files instead of hardcoded
    • GraphConfig module for parsing YAML configurations
    • Support for both JSON and YAML formats
    • 70% code reduction in graph executors
    • See YAML Configuration Guide
  • ๐Ÿ”ง Enhanced Graph Executor API
    • execute() - Use default configuration
    • execute_with_config(config_path) - Load custom YAML config
    • Dynamic node registration from config
  • ๐Ÿ“ Multiple Workflow Support
    • Standard flow (full process)
    • Simplified flow (skip optional steps)
    • Urgent flow (fast-track)
    • Easy to create custom workflows
  • ๐Ÿ—๏ธ Monolithic Clean Architecture (NEW)
    • Multi-database architecture with 4 PostgreSQL databases
    • Dynamic field mapping via YAML configuration
    • Zero hardcoded field names in code
    • Database routing per node via config
    • field_mappings for flexible data extraction
    • RuleEngineService accepts HashMap<String, Value>
    • Config-driven DynamicDBNode and DynamicRuleNode
  • ๐Ÿ“š Comprehensive Documentation
    • YAML configuration guide with examples
    • Before/After comparison showing improvements
    • Multiple workflow examples
    • Integration guides for both architectures
    • Clean architecture patterns documentation

Improvements:

  • Monolithic and Microservices both support YAML configs
  • Reduced boilerplate code by 70% in executors
  • Better separation of concerns (config vs. code)
  • Easier testing with multiple configurations
  • No recompilation needed for workflow changes
  • Complete flexibility in field naming and mapping

Examples:

# Monolithic with multi-database
nodes:
  oms_history:
    database: "oms_db"
    query: "SELECT ..."
  rule_engine:
    field_mappings:
      avg_daily_demand: "oms_history.avg_daily_demand"
// Dynamic field extraction (no hardcoding)
let inputs = self.extract_rule_inputs(ctx);
rule_service.evaluate(inputs)?;  // HashMap<String, Value>

Compatibility:

  • All tests passing
  • API backward compatible
  • Existing hardcoded graphs still work

v0.8.0 (2025-11-20) - Web Editor & Production Case Study Release

New Features:

  • ๐ŸŽจ Web Graph Editor - Next.js visual editor with drag-and-drop
  • ๐Ÿข Production Case Study - Complete purchasing flow system
    • Microservices architecture (7 services with gRPC)
    • Monolithic architecture (single HTTP service)
    • 15 GRL business rules for purchasing decisions
    • Kubernetes deployment manifests
    • Docker Compose for local development
    • Shared GRL rules proving portability
    • See Case Study Documentation

Improvements:

  • Updated README with case study section
  • Added online graph editor link
  • Comprehensive production examples

Compatibility:

  • All tests passing
  • API backward compatible

v0.5.0 (2025-11-06) - Performance & Developer Tools Release

Breaking Changes:

  • โšก Upgraded rust-rule-engine from v0.10 โ†’ v0.14.0
    • Now uses RETE-UL algorithm (2-24x faster)
    • Better memory efficiency
    • Improved conflict resolution
    • See Migration Guide

New Features:

  • ๐Ÿ› ๏ธ CLI Developer Tools (rlg binary)
    • Graph validation with comprehensive checks
    • Dry-run execution mode
    • Performance profiling with statistics
    • ASCII graph visualization
    • See CLI Tool Guide
  • ๐Ÿ’พ Caching Layer - High-performance result caching
    • TTL-based expiration
    • Multiple eviction policies (LRU, LFU, FIFO)
    • Memory limits and statistics
    • See Cache Guide
  • โšก Parallel Node Execution - Automatic detection and parallel execution
    • Layer detection algorithm using topological sort
    • Concurrent execution within layers
    • Parallelism analysis and statistics
  • ๐Ÿ“Š ParallelExecutor - New executor with parallel capabilities
  • ๐Ÿ“ New Examples - CLI examples and test graphs
  • โœ… 32 Tests - Comprehensive test coverage

Improvements:

  • Updated documentation with CLI tools, caching, and migration guides
  • Performance benchmarking utilities
  • Example graph files for testing

Compatibility:

  • All 32 tests passing
  • API is backward compatible (100%)
  • Performance: 2-24x faster rule matching

v0.3.0 (2025-11-03) - Streaming & Performance Release

New Features:

  • ๐ŸŒŠ Streaming Processing - Stream-based node execution
    • Backpressure handling with bounded channels
    • Large dataset support with chunking
    • Stream operators (map, filter, fold, async map)
  • ๐Ÿ“ New Example - streaming_flow.rs with 6 demonstrations
  • โœ… 8 New Tests - Streaming module testing

Performance:

  • Processed 10,000 items in chunks
  • ~432 items/sec throughput with backpressure

v0.2.0 (2025-11-02) - Integrations Release

New Features:

  • ๐Ÿ—„๏ธ Database Integrations - PostgreSQL, MySQL, Redis, MongoDB
  • ๐Ÿค– AI/LLM Integrations - OpenAI GPT-4, Claude 3.5, Ollama
  • ๐Ÿ“ Integration Examples - postgres_flow.rs, openai_flow.rs
  • ๐Ÿ“š INTEGRATIONS.md - Comprehensive integration guide
  • ๐ŸŽ›๏ธ Feature Flags - Optional dependencies for integrations

v0.1.0 (2025-11-01) - Initial Release

Core Features:

  • ๐Ÿง  Core graph execution engine
  • ๐Ÿ”ฅ GRL (Grule Rule Language) integration
  • ๐Ÿ”„ Topological sorting
  • โšก Async execution with Tokio
  • ๐Ÿ“Š Three node types (Rule, DB, AI)
  • ๐Ÿ“ JSON I/O for graphs
  • ๐Ÿ“š 4 working examples
  • โœ… 6/6 tests passing

๐Ÿ“„ License

MIT License - see LICENSE for details.


๐Ÿ”— Links


๐Ÿ‘ฅ Authors

James Vu - Initial work


๐Ÿ™ Acknowledgments

Built with:


โญ Star us on GitHub if you find this useful! โญ

Documentation โ€ข Examples โ€ข Use Cases โ€ข YAML Config Guide