Package eu.admire.dispel.graph

Examples of eu.admire.dispel.graph.Graph

120
121
122
123
124
125
126
127
128
129
130
131
132
        ResultNode result = new ResultNode("result");
        a.connectOutput("out", 0, b.getInput("in", 0));
        out.connectInput(b.getOutput("out", 0));
        a.connectInput("in", 0, in.getOutput());
        result.connectInput(b.getOutput("xxx", 0));
        Graph graph = new Graph();
        graph.add(a);
        graph.add(b);
        graph.add(in);
        graph.add(out);
        graph.add(result);
//        System.out.println(GraphConverter.convertToDISPEL(graph));
    }
View Full Code Here
136
137
138
139
140
141
142
143
144
145
146
        ProcessingElementNode a = new ProcessingElementNode("eu.admire.A");
        ProcessingElementNode b = new ProcessingElementNode("eu.admire.B");
        ResultNode result = new ResultNode("result");
        a.connectOutput("out", 0, b.getInput("in", 0));
        result.connectInput(b.getOutput("out", 0));
        Graph graph = new Graph();
        graph.add(a);
        graph.add(b);
        graph.add(result);
//        System.out.println(GraphConverter.convertToDISPEL(graph));
    }
View Full Code Here
150
151
152
153
154
155
156
157
158
159
160
        ProcessingElementNode a = new ProcessingElementNode("eu.admire.A");
        ProcessingElementNode dt = new ProcessingElementNode("eu.admire.DataTransfer");
        ProcessingElementNode b = new ProcessingElementNode("eu.admire.B");
        a.connectOutput("out", 0, dt.getInput("input", 0));
        dt.connectOutput("output", 0, b.getInput("in", 0));
        Graph graph = new Graph();
        graph.add(a);
        graph.add(b);
        graph.add(dt);
//        System.out.println(GraphConverter.convertToDISPEL(graph));
    }
View Full Code Here
177
178
179
180
181
182
183
184
185
186
187
188
        ProcessingElementNode b = new ProcessingElementNode("eu.admire.B");
        ProcessingElementNode c = new ProcessingElementNode("eu.admire.C");
        ProcessingElementNode d = new ProcessingElementNode("eu.admire.D");
        a.connectOutput("out", 0, b.getInput("in", 0));
        c.connectOutput("out", 0, d.getInput("in", 0));
        Graph graph = new Graph();
        graph.add(a);
        graph.add(b);
        graph.add(c);
        graph.add(d);
//        System.out.println(GraphConverter.convertToDISPEL(graph));
    }
View Full Code Here
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
    @Override
    public Graph transform(RequestContext context, Graph graph)
            throws TransformationException
    {
        LOG.debug("Flattening DISPEL graph.");
        Graph newGraph = new Graph();
        for (RequestNode node : graph.getNodes())
        {
            if (node instanceof CompositeProcessingElement)
            {
                List<RequestNode> elements =
                    ((CompositeProcessingElement) node).getElements();
                newGraph.addAll(elements);
            }
            else
            {
                newGraph.add(node);
            }
        }
        return newGraph;
    }
View Full Code Here
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
    @Test
    public void testSimple() throws Exception
    {
        GatewayLocation gw1 = new SimpleGatewayLocation("GWA", "EPR");
        GatewayLocation gw2 = new SimpleGatewayLocation("GWB", "EPR");
        Graph graph = new Graph();
        ProcessingElementNode a = new ProcessingElementNode("A");
        a.addAnnotation(AnnotationKeys.GATEWAY, gw1);
        ProcessingElementNode b = new ProcessingElementNode("B");
        b.addAnnotation(AnnotationKeys.GATEWAY, gw1);
        ProcessingElementNode c = new ProcessingElementNode("C");
        c.addAnnotation(AnnotationKeys.GATEWAY, gw2);
        b.connectInput("in", 0, a.getOutput("out", 0));
        graph.add(a); graph.add(b); graph.add(c);
       
        SimplePartitioner partitioner = new SimplePartitioner();
        Map<GatewayLocation, Graph> partitions = partitioner.partition(graph);
        TestCase.assertEquals(2, partitions.size());
        Graph g = partitions.get(gw1);
        TestCase.assertTrue(g.getNodes().containsAll(Arrays.asList(a, b)));
        g = partitions.get(gw2);
        TestCase.assertTrue(g.getNodes().contains(c));
    }
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
        b.connectInput("in1", 0, a.getOutput("out", 0));
        ProcessingElementNode c = new ProcessingElementNode("C");
        b.connectInput("in2", 0, c.getOutput("out", 0));
        ProcessingElementNode d = new ProcessingElementNode("D");
        ProcessingElementNode e = new ProcessingElementNode("E");
        Graph graph = GraphUtilities.getConnectedComponent(a);
        List<RequestNode> nodes = graph.getNodes();
        Assert.assertEquals(3, nodes.size());
        Assert.assertTrue(nodes.contains(a));
        Assert.assertTrue(nodes.contains(b));
        Assert.assertTrue(nodes.contains(c));
    }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
        c.connectInput("in", 0, b.getOutput("out", 0));
        a.connectInput("in", 0, c.getOutput("out", 0));
        ProcessingElementNode d = new ProcessingElementNode("D");
        d.connectInput("in", 0, b.getOutput("out2", 0));
        ProcessingElementNode e = new ProcessingElementNode("E");
        Graph graph = GraphUtilities.getConnectedComponent(a);
        List<RequestNode> nodes = graph.getNodes();
        Assert.assertEquals(4, nodes.size());
        Assert.assertTrue(nodes.contains(a));
        Assert.assertTrue(nodes.contains(b));
        Assert.assertTrue(nodes.contains(c));
        Assert.assertTrue(nodes.contains(d));
View Full Code Here
56
57
58
59
60
61
62
63
64
65
   
    @Test
    public void testSingleNode()
    {
        ProcessingElementNode a = new ProcessingElementNode("A");
        Graph graph = GraphUtilities.getConnectedComponent(a);
        List<RequestNode> nodes = graph.getNodes();
        Assert.assertEquals(1, nodes.size());
        Assert.assertTrue(nodes.contains(a));
    }
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
84
        a.connectInput("in", 0, b.getOutput("out", 0));
        CompositeProcessingElement composite =
            new CompositeProcessingElement("C", Arrays.<RequestNode>asList(a, b));
        composite.setInput("in", 0, b.getInput("in", 0));
        c.connectOutput("out", 0, composite.getInput("in", 0));
        Graph graph = GraphUtilities.getConnectedComponent(composite);
        List<RequestNode> nodes = graph.getNodes();
        System.out.println(graph);
        Assert.assertEquals(2, nodes.size());
        Assert.assertTrue(nodes.contains(composite));
        Assert.assertTrue(nodes.contains(c));
    }
View Full Code Here
TOP

Related Classes of eu.admire.dispel.graph.Graph

  • eu.admire.dispel.engine.DispelEngineTest
  • eu.admire.dispel.engine.SimpleLocalOptimiser
  • eu.admire.dispel.graph.converter.GraphConverter
  • eu.admire.dispel.parser.v4.builder.CreatePETypeStrategy
  • eu.admire.dispel.parser.v4.builder.DISPELGraphBuilderTest
  • eu.admire.dispel.parser.v4.builder.RootStrategy
  • eu.admire.gateway.dmil.graph.converter.GraphConverterTest
  • eu.admire.gateway.dmil.graph.GraphUtilitiesTest
  • eu.admire.gateway.dmil.graph.visualisation.DotGeneratorTest
  • eu.admire.gateway.engine.ogsadai.PartitionedGraphToWorkflowsTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.