Class AbstractGraph<V extends AbstractVertex<V,​E,​O>,​E extends AbstractEdge<V,​E,​O>,​O>

java.lang.Object
kieker.tools.trace.analysis.filter.visualization.graph.AbstractGraph<V,​E,​O>
Type Parameters:
V - The type of the graph's vertices
E - The type of the graph's edges
O - The type of object from which the graph's elements originate
Direct Known Subclasses:
AbstractDependencyGraph, AbstractDependencyGraph

public abstract class AbstractGraph<V extends AbstractVertex<V,​E,​O>,​E extends AbstractEdge<V,​E,​O>,​O>
extends java.lang.Object
Generic superclass for all graphs in the visualization package.
Since:
1.6
  • Nested Class Summary

    Nested Classes 
    Modifier and Type Class Description
    static interface  AbstractGraph.IGraphVisitor<V,​E>
    Interface for abstract-graph visitors.
  • Constructor Summary

    Constructors 
    Constructor Description
    AbstractGraph()  
  • Method Summary

    Modifier and Type Method Description
    abstract java.util.Collection<V> getVertices()
    Returns the vertices contained in this graph.
    void traverse​(AbstractGraph.IGraphVisitor<V,​E> visitor)
    Traverses this graph using the given visitor.
    void traverseWithVerticesFirst​(AbstractGraph.IGraphVisitor<V,​E> visitor)
    Traverses this graph using the given visitor.

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
  • Constructor Details

  • Method Details

    • getVertices

      public abstract java.util.Collection<V> getVertices()
      Returns the vertices contained in this graph.
      Returns:
      See above
    • traverse

      public void traverse​(AbstractGraph.IGraphVisitor<V,​E> visitor)
      Traverses this graph using the given visitor. Outgoing edges are traversed immediately after their owning node.
      Parameters:
      visitor - The visitor to call during traversal
    • traverseWithVerticesFirst

      public void traverseWithVerticesFirst​(AbstractGraph.IGraphVisitor<V,​E> visitor)
      Traverses this graph using the given visitor. All vertices are visited before the first edge.
      Parameters:
      visitor - The visitor to call during traversal