Examples of classycle.graph.StrongComponent

classycle.graph.StrongComponent
A strong component is a subgraph of a directed graph where every two vertices are mutually reachable. @author Franz-Josef Elmer

    checkClassGraph("printComponents()");
    StrongComponent[] components = getCondensedClassGraph();
    StrongComponentRenderer renderer = new PlainStrongComponentRenderer();
    for (int i = 0; i < components.length; i++) 
    {
      StrongComponent component = components[i];
      if (component.getNumberOfVertices() >= minSize) 
      {
        writer.println(renderer.render(component));
      }
    }
    writer.close();

View Full Code Here


  private StrongComponent getCycleFor(AtomicVertex vertex, List cycles)
  {
    for (int i = 0, n = cycles.size(); i < n; i++)
    {
      StrongComponent cycle = (StrongComponent) cycles.get(i);
      for (int j = 0, m = cycle.getNumberOfVertices(); j < m; j++)
      {
        if (cycle.getVertex(j) == vertex) 
        {
          return cycle;
        }
      }
    }

View Full Code Here

    StrongComponentAnalyser analyser = new StrongComponentAnalyser(graph);
    Vertex[] condensedGraph = analyser.getCondensedGraph();
    CyclesResult result = new CyclesResult(createStatement(), _packageCycles);
    for (int i = 0; i < condensedGraph.length; i++)
    {
      StrongComponent strongComponent = (StrongComponent) condensedGraph[i];
      if (strongComponent.getNumberOfVertices() > _maximumSize)
      {
        result.addCycle(strongComponent);
      }
    }
    return result;

View Full Code Here

TOP

Related Classes of classycle.graph.StrongComponent

classycle.Analyser

classycle.dependency.CheckCyclesStatement

java.util.ArrayList

java.util.HashMap

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.