kieker.tools.traceAnalysis.filter.visualization.dependencyGraph
Class AbstractDependencyGraph<T extends ISystemModelElement>

java.lang.Object
  kieker.tools.traceAnalysis.filter.visualization.graph.AbstractGraph<DependencyGraphNode<T>,WeightedBidirectionalDependencyGraphEdge<T>,TraceInformation>
      kieker.tools.traceAnalysis.filter.visualization.dependencyGraph.AbstractDependencyGraph<T>

Type Parameters:

T - The type of the nodes' payload

Direct Known Subclasses:

ComponentAllocationDependencyGraph, ComponentAssemblyDependencyGraph, ContainerDependencyGraph, OperationAllocationDependencyGraph, OperationAssemblyDependencyGraph

public abstract class AbstractDependencyGraph<T extends ISystemModelElement>
extends AbstractGraph<DependencyGraphNode<T>,WeightedBidirectionalDependencyGraphEdge<T>,TraceInformation>

Abstract superclass for dependency graphs.

Since:

1.6

Author:

Andre van Hoorn, Lena Stöver

Nested Class Summary

Nested classes/interfaces inherited from class kieker.tools.traceAnalysis.filter.visualization.graph.AbstractGraph

AbstractGraph.IGraphVisitor<V,E>

Constructor Summary

AbstractDependencyGraph(T rootEntity)
Creates a new dependency graph with the given root entity.

Method Summary

protected void	addNode(int i, DependencyGraphNode<T> node) Adds a node to this graph.
protected DependencyGraphNode<T>	getNode(int i) Delivers the node with the given key.
java.util.Collection<DependencyGraphNode<T>>	getNodes() Returns all nodes contained in this graph.
DependencyGraphNode<T>	getRootNode() Returns this graph's root node.
java.util.Collection<DependencyGraphNode<T>>	getVertices() Returns the vertices contained in this graph.
int	size() Returns the number of nodes contained in this graph.

Methods inherited from class kieker.tools.traceAnalysis.filter.visualization.graph.AbstractGraph

traverse, traverseWithVerticesFirst

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

AbstractDependencyGraph

public AbstractDependencyGraph(T rootEntity)

Creates a new dependency graph with the given root entity.

Parameters:

rootEntity - The entity from which the root node originates

Method Detail

getNode

protected final DependencyGraphNode<T> getNode(int i)

Delivers the node with the given key.

Parameters:

i - The key to search for.

Returns:

The corresponding node to the given key if it exists, null otherwise.

addNode

protected final void addNode(int i,
                             DependencyGraphNode<T> node)

Adds a node to this graph.

Parameters:

i - The key of the node.

node - The node itself.

getRootNode

public final DependencyGraphNode<T> getRootNode()

Returns this graph's root node.

Returns:

See above

getNodes

public java.util.Collection<DependencyGraphNode<T>> getNodes()

Returns all nodes contained in this graph.

Returns:

See above

size

public int size()

Returns the number of nodes contained in this graph.

Returns:

See above

getVertices

public java.util.Collection<DependencyGraphNode<T>> getVertices()

Description copied from class: AbstractGraph

Returns the vertices contained in this graph.

Specified by:

getVertices in class AbstractGraph<DependencyGraphNode<T extends ISystemModelElement>,WeightedBidirectionalDependencyGraphEdge<T extends ISystemModelElement>,TraceInformation>

Returns:

See above