Examples of vertexSet()

Examples of cascading.flow.planner.graph.ElementGraph.vertexSet()

82
83
84
85
86
87
88
89
90
91
92
      maskedScopes.addAll( next.edgeSet() ); // catches case with no elements on path

      return next;
      }

    maskedElements.removeAll( next.vertexSet() );
    maskedScopes.removeAll( next.edgeSet() );

    return new ElementMaskSubGraph( parentIterator.getElementGraph(), maskedElements, maskedScopes );
    }
View Full Code Here

Examples of cascading.flow.planner.graph.ElementGraph.vertexSet()

180
181
182
183
184
185
186
187
188
189
190
      ElementGraph contractedMatchedGraph = match.getMatchedGraph();

      Set<FlowElement> excludes = new HashSet<>( getContractedGraph().vertexSet() );

      excludes.removeAll( contractedMatchedGraph.vertexSet() );

      return asSubGraph( elementGraph, contractedMatchedGraph, excludes );
      }
    finally
      {
View Full Code Here

Examples of cascading.flow.planner.graph.FlowElementGraph.vertexSet()

228
229
230
231
232
233
234
235
236
237
238
        {
        case Assembly:

          FlowElementGraph finalFlowElementGraph = ruleResult.getAssemblyGraph();

          if( finalFlowElementGraph.vertexSet().isEmpty() )
            throw new PlannerException( "final assembly graph is empty: " + ruleResult.getRegistry().getName() );

          break;

        case Step:
View Full Code Here

Examples of cu.repsystestbed.graphs.Graph.vertexSet()

75
76
77
78
79
80
81
82
83
84
85
    {
      /*
       * For every src and sink in the input graph, create an edge in the output graph
       */
      Graph graphTransitive = ((Graph)this.m_graph2Listen).getTransitiveClosureGraph();
      for(Agent src: (Set<Agent>) graphTransitive.vertexSet())
      {
        for(Agent sink: (Set<Agent>) graphTransitive.vertexSet())
        {
          if(!src.equals(sink))
          {
View Full Code Here

Examples of cu.repsystestbed.graphs.Graph.vertexSet()

77
78
79
80
81
82
83
84
85
86
87
       * For every src and sink in the input graph, create an edge in the output graph
       */
      Graph graphTransitive = ((Graph)this.m_graph2Listen).getTransitiveClosureGraph();
      for(Agent src: (Set<Agent>) graphTransitive.vertexSet())
      {
        for(Agent sink: (Set<Agent>) graphTransitive.vertexSet())
        {
          if(!src.equals(sink))
          {
            m_graph2Output.addVertex(src);
            m_graph2Output.addVertex(sink);
View Full Code Here

Examples of edu.stanford.nlp.semgraph.SemanticGraph.vertexSet()

627
628
629
630
631
632
633
634
635
636
637
    runTest("{idx:4}", graph);
  }

  public void testLemma() {
    SemanticGraph graph = SemanticGraph.valueOf("[ate subj:Bill dobj:[muffins nn:blueberry]]");
    for (IndexedWord word : graph.vertexSet()) {
      word.setLemma(word.word());
    }
    runTest("{lemma:ate}", graph, "ate");

    Tree tree = Tree.valueOf("(ROOT (S (NP (PRP I)) (VP (VBP love) (NP (DT the) (NN display))) (. .)))");
View Full Code Here

Examples of edu.stanford.nlp.semgraph.SemanticGraph.vertexSet()

634
635
636
637
638
639
640
641
642
643
644
    }
    runTest("{lemma:ate}", graph, "ate");

    Tree tree = Tree.valueOf("(ROOT (S (NP (PRP I)) (VP (VBP love) (NP (DT the) (NN display))) (. .)))");
    graph = SemanticGraphFactory.generateCCProcessedDependencies(tree);
    for (IndexedWord word : graph.vertexSet()) {
      word.setLemma(word.word());
    }
    // This set of three tests also provides some coverage for a
    // bizarre error a user found where multiple copies of the same
    // IndexedWord were created
View Full Code Here

Examples of edu.stanford.nlp.semgraph.SemanticGraph.vertexSet()

21
22
23
24
25
26
27
28
29
30
31
public class SemgrexTest extends TestCase {

  public void testMatchAll() {
    SemanticGraph graph =
      SemanticGraph.valueOf("[ate subj:Bill dobj:[muffins nn:blueberry]]");
    Set<IndexedWord> words = graph.vertexSet();

    SemgrexPattern pattern = SemgrexPattern.compile("{}");
    SemgrexMatcher matcher = pattern.matcher(graph);
    String[] expectedMatches = {"ate", "Bill", "muffins", "blueberry"};
    for (int i = 0; i < expectedMatches.length; ++i) {
View Full Code Here

Examples of net.sf.graphiti.model.Graph.vertexSet()

193
194
195
196
197
198
199
200
201
202
203
  @Override
  public List<Object> getModelChildren() {
    Graph graph = (Graph) getModel();
    List<Object> children = new ArrayList<Object>();
    children.addAll(graph.vertexSet());
    return children;
  }

  @Override
  public boolean isSelectable() {
View Full Code Here

Examples of net.sf.graphiti.model.Graph.vertexSet()

236
237
238
239
240
241
242
243
244
245
246
    // get ports from graph
    if (graph == null) {
      return new ArrayList<String>();
    } else {
      Set<Vertex> vertices = graph.vertexSet();
      List<String> ports = new ArrayList<String>();
      for (Vertex vertex : vertices) {
        // check the vertex type against all accepted port types.
        for (String portType : portTypes) {
          if (vertex.getType().getName().equals(portType)) {
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.