Graphs are the containers of your Plastic-IO programs. Graphs contain a collection of Nodes.
Nodes contain a unit of executable code, along with view, test and any other code templates that
constitute the functionality of the unit of code. See Node for more information.
Graphs can be linked into other graphs. When linked, the graph appears to be a node on the host graph.
A special map (See linkedGraph, fields) is created based on any Node edges with the boolean value external set to true.
This map makes specified edges on the internal graph connectable on the host graph via edges that will
appear on the linked graph.
To "start" a graph you typically point url at a url, which will invoke the Node's set function (set)
Graphs are the containers of your Plastic-IO programs. Graphs contain a collection of Nodes. Nodes contain a unit of executable code, along with view, test and any other code templates that constitute the functionality of the unit of code. See Node for more information.
Graphs can be linked into other graphs. When linked, the graph appears to be a node on the host graph. A special map (See linkedGraph, fields) is created based on any Node edges with the boolean value
externalset to true. This map makes specified edges on the internal graph connectable on the host graph via edges that will appear on the linked graph.To "start" a graph you typically point url at a url, which will invoke the Node's set function (set)