GraphicalRepresentation (DependencyTool 0.0.1-SNAPSHOT API)

java.lang.Object
- org.palladiosimulator.dependencytool.GraphicalRepresentation

```
public class GraphicalRepresentation
extends Object
```
Holds a graph object constructed out of dependencies given in repository Objects.

Constructor Summary

Constructors
Constructor Description

GraphicalRepresentation(Set<RepositoryObject> repositories)
Creates a new GraphicalRepresentation object.

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`void`	`createTopologyHierarchy()`	Creates topology layers of elements which are interchangeable in the topology of this graph.
`org.jgrapht.graph.SimpleDirectedGraph<RepositoryObject,CustomEdge>`	`getGraph()`
`List<Set<RepositoryObject>>`	`getTopologyHierachy()`
`boolean`	`hasCycles(boolean showCycles)`	Check if the graph has cycles.

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - GraphicalRepresentation
```
public GraphicalRepresentation(Set<RepositoryObject> repositories)
```
    Creates a new GraphicalRepresentation object. Creates a new simple directed graph adding all repository names as vertices and all dependencies as edges.
    
    Parameters:
    
    repositories - A set containing RepositoryObjects.
- Method Detail
  - getGraph
```
public org.jgrapht.graph.SimpleDirectedGraph<RepositoryObject,CustomEdge> getGraph()
```
  - getTopologyHierachy
```
public List<Set<RepositoryObject>> getTopologyHierachy()
```
  - hasCycles
```
public boolean hasCycles(boolean showCycles)
```
    Check if the graph has cycles. If showCycles is true then print the detected cycles.
    
    Parameters:
    
    showCycles - If true print detected cycles.
    
    Returns:
    
    true if there are cycles, false otherwise.
  - createTopologyHierarchy
```
public void createTopologyHierarchy()
```
    Creates topology layers of elements which are interchangeable in the topology of this graph.