Package classycle.graph

Examples of classycle.graph.VertexCondition


    ResultContainer result = new ResultContainer();
    boolean directPathsOnly = DIRECTLY_INDEPENDENT_OF_KEY_WORD.equals(_dependencyType);
    boolean dependsOnly = DependencyDefinitionParser.DEPENDENT_ONLY_ON_KEY_WORD.equals(_dependencyType);
    for (int i = 0; i < _startConditions.length; i++)
    {
      VertexCondition startCondition = _startConditions[i];
      StringPattern startSet = _startSets[i];
      if (dependsOnly)
      {
        Set<AtomicVertex> invalids = new HashSet<AtomicVertex>();
        for (AtomicVertex vertex : graph)
        {
          if (startCondition.isFulfilled(vertex))
          {
            for (int j = 0, n = vertex.getNumberOfOutgoingArcs(); j < n; j++)
            {
              Vertex headVertex = vertex.getHeadVertex(j);
              if (_finalCondition.isFulfilled(headVertex) == false
                      && startCondition.isFulfilled(headVertex) == false)
              {
                invalids.add(vertex);
                invalids.add((AtomicVertex) headVertex);
              }
            }
View Full Code Here

TOP

Related Classes of classycle.graph.VertexCondition

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.