Graph-RAT Programming Environment |
||
OverviewDocumentation0.4.3 Javadoc0.5.1 Javadoc0.4.3 GUI use0.5 GUI useCommand Line Use0.4.3 Embedded Use0.5 Embedded UseDeveloping Graph-RATModule ListingRoadmap |
Embedding in Graph-RAT 0.4.3Graph only setupCreating embedded graphs in Graph-RAT are best done by calls to the GraphFactory singleton. What graph and what properties are controlled by a Properties object. It has the following properties:
Nodes are created by use of the ActorFactory singleton. The Properties object contains the parameters for the Actor. The parameters are as follows:
Links are created by use of the LinkFactory singleton. The Properties object contains the parameters for the Actor. The parameters are as follows:
Nodes and Links are added and retreived from a graph by reference - modifications to the contents are reflected in the graph and vice-versa. Once a graph iterator is utilized, changes to the references to links or nodes (i.e. adding or removing links or nodes or altering link source-relation-destination or altering node mode or id) throws an ConcurrantModificationException. Individual Algorithm executionInstantiating an algorithm is done using a AlgorithmFactory. The Properties object has the following parameters:
The algorithm executes over a graph (see above) using the Graph:execute method. Scheduler ExecutionSchedulers are created using the SchedulerFactory singleton. The parameters are as follows:
Data Acquisition algorithms are added directly. Algorithms are added with a regular expression and an algorithm. Upon execution, the regular expression is matched against the tree of graphs (graphs and all subgraphs beneath it) where only the highest level nodes are then scheduled for execution. For example, '.*' matches only the root node, as it will match the root id as well as all subgraphs beneath it. Data Acquisitions are executed first in the order they are added. Likewise, the algorithm-patterns are executed in the order they are added where the algorithm is repeatedly executed against each matching graph of the pattern. |