Core Concept

At the core of N2 is a simple but powerful concept: every node is a process. Each process can accept inputs and produce outputs, and when connected, nodes form a chain—or graph—of automation tasks.

classDiagram
    class Graph {
    }

    class Node {
    }

    class Port {
    }

    class Edge {
    }

    Graph *-- Node
    Graph *-- Edge
    Node *-- Port
    Edge --> Port
    Edge --> Port

N2 Core Concept

In N2, a graph is the central entity that represents a complete automation workflow. It is composed of nodes (representing actions, conditions, data handling, etc.) and edges (representing the relationships and data flow between nodes).

Nodes and Edges

Nodes

A node represents a single step or action in a workflow. Each node is defined by the following attributes:

• Type: The type of the node.
• Configuration: Node-specific settings that determine its behavior.
• Ports: Interfaces through which a node interacts with other nodes:
  • Input ports: Receive data or control signals.
  • Output ports: Send data or control signals.
  • Auxiliary input ports: Optional inputs to support additional functionality.
  • Auxiliary output ports: Optional outputs to provide extended functionality.

Edges

Edges define the connections between nodes and dictate the flow of data or control. Each edge connects an output port of one node to an input port of another node, establishing both logical and functional relationships in the workflow.

Graph Execution

Graphs in N2 are executed by traversing nodes and edges, processing each node according to its type and configuration. Execution typically begins at a start node and proceeds along defined paths until all nodes have been processed or a termination condition is met.

sequenceDiagram
    participant Graph
    participant StartNode
    participant NextNode
    participant CurrentNode
    Graph->>StartNode: Start execution
    StartNode->>NextNode: Process
    NextNode->>CurrentNode: Set
    loop Each node in path
        CurrentNode->>CurrentNode: Process
        CurrentNode->>NextNode: Get next node
    end
    CurrentNode->>Graph: Return result

Standard Node Sequencing