Examples of classycle.graph.Vertex

classycle.graph.Vertex
The base class for any type of vertex in a directed graph.
A Vertex holds an {@link Attributes} object which encapsulatesall properties of the vertex which are not necessary to know for parsing a graph in a {@link GraphProcessor}. Only the visited flag will be manipulated during parsing.
A Vertex knows the head and tail vertices of all its outgoing and incoming arcs. When a head vertex is added by the method {@link #addOutgoingArcTo} also the corresponding incoming arc is builtin the head vertex. The same is true the other way around. Note, that multi-arcs are not possible. That is, adding an already added head/tail vertex again as a head/tail vertex will be ignored. @author Franz-Josef Elmer

   * only a class and its inner classes the name is the fully-qualified
   * class name of the outer class extended by "and inner classes".
   */
  public static String createName(StrongComponent component) {
    GraphAttributes ga = (GraphAttributes) component.getAttributes();
    Vertex fragmenter = ga.getBestFragmenters()[0];
    String result = ((NameAttributes) fragmenter.getAttributes()).getName();
    //String result = component.getVertex(0).getAttributes().toString();
    if (component.getNumberOfVertices() > 1) {
      AtomicVertex vertex = component.getVertex(0);
      NameAttributes attributes = (NameAttributes) vertex.getAttributes();
      String outerClass = attributes.getName();

View Full Code Here

  public void renderGraph(DependencyPathRenderer renderer)
  {
    Set<Vertex> visitedVertices = new HashSet<Vertex>();
    for (int i = 0; i < _graph.length; i++)
    {
      Vertex vertex = _graph[i];
      if (_startSetCondition.isFulfilled(vertex))
      {
        renderer.add(getNameOf(vertex));
        renderPaths(renderer, vertex, visitedVertices);
      }

View Full Code Here

  {
    visitedVertices.add(vertex);
    renderer.increaseIndentation();
    for (int i = 0, n = vertex.getNumberOfOutgoingArcs(); i < n; i++)
    {
      Vertex headVertex = vertex.getHeadVertex(i);
      if (_vertices.contains(headVertex)
          && !_startSetCondition.isFulfilled(headVertex))
      {
        renderer.add(getNameOf(headVertex));
        if (!_finalSetCondition.isFulfilled(headVertex)

View Full Code Here

        {
          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.Vertex

classycle.dependency.DependencyPathsRenderer

classycle.dependency.DependencyStatement

classycle.renderer.AbstractStrongComponentRenderer

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.