public class AnnotatedTypeGraph
extends de.uni_due.inf.ti.graph.Graph
Constructor and Description |
---|
AnnotatedTypeGraph()
Creates a new multiply annotated type graph.
|
AnnotatedTypeGraph(AnnotatedTypeGraph orig)
Creates a new multiply annotated type graph which is a copy of another graph.
|
AnnotatedTypeGraph(de.uni_due.inf.ti.graph.Graph orig)
Creates a new annotated type graph which is a standard annotated copy of a graph.
|
AnnotatedTypeGraph(java.lang.String name)
Creates a new multiply annotated type graph with a specified name.
|
Modifier and Type | Method and Description |
---|---|
de.uni_due.inf.ti.graph.Edge |
addAnnotatedEdge(de.uni_due.inf.ti.graph.Label label,
AnnotationBounds bounds,
java.util.List<de.uni_due.inf.ti.graph.Node> nodes)
Adds an annotated edge to the graph
|
de.uni_due.inf.ti.graph.Edge |
addAnnotatedEdge(de.uni_due.inf.ti.graph.Label label,
AnnotationBounds bounds,
de.uni_due.inf.ti.graph.Node... nodes)
Adds an annotated edge to the graph
|
de.uni_due.inf.ti.graph.Edge |
addAnnotatedEdge(de.uni_due.inf.ti.graph.Label label,
int min,
int max,
java.util.List<de.uni_due.inf.ti.graph.Node> nodes)
Adds an annotated edge to the graph
|
de.uni_due.inf.ti.graph.Edge |
addAnnotatedEdge(de.uni_due.inf.ti.graph.Label label,
int min,
int max,
de.uni_due.inf.ti.graph.Node... nodes)
Adds an annotated edge to the graph
|
de.uni_due.inf.ti.graph.Node |
addAnnotatedNode(AnnotationBounds bounds)
Adds a fresh node with annotation bounds
|
de.uni_due.inf.ti.graph.Node |
addAnnotatedNode(int min,
int max)
Adds a fresh node with annotation bounds
|
boolean |
addMultiplicity(java.util.HashMap<de.uni_due.inf.ti.graph.GraphElement,AnnotationBounds> multiplicity)
Adds a multiplicity to the set of annotations for this multiply annotated type graph
|
de.uni_due.inf.ti.graph.Edge |
addStandardAnnotatedEdge(de.uni_due.inf.ti.graph.Label label,
de.uni_due.inf.ti.graph.Node... nodes)
Adds a standard annotated edge to the graph
|
de.uni_due.inf.ti.graph.Node |
addStandardAnnotatedNode()
Adds a fresh standard annotated node
|
AnnotatedTypeGraph |
clone()
Returns a copy of this graph
|
int |
getActiveMultiplicityIndex()
Returns the position of the current multiplicity of this multiply annotated type graph graph
|
AnnotationBounds |
getAnnotationBounds(de.uni_due.inf.ti.graph.GraphElement element)
Gets the active annotation bound of a graph element
|
java.lang.String |
getBoundLabel(de.uni_due.inf.ti.graph.GraphElement element)
Gets the String representation of the elements boundaries
|
de.uni_due.inf.ti.graph.Node |
getCopiedNode(de.uni_due.inf.ti.graph.Node orig)
Returns the node copy of a copied graph
|
java.util.HashMap<de.uni_due.inf.ti.graph.GraphElement,AnnotationBounds> |
getCurrentMultiplicity()
Gets the active multiplicity
|
java.util.List<de.uni_due.inf.ti.graph.Edge> |
getEdgeList()
Gets a list of edges in this graph
|
int |
getLimit()
Gets the limit of this graph
|
int |
getMaxBound(de.uni_due.inf.ti.graph.GraphElement element)
Gets the active max bound of a graph element
|
java.util.List<java.lang.Integer> |
getMaxBounds(de.uni_due.inf.ti.graph.GraphElement element)
Gets the list of max bounds of a graph element
|
int |
getMinBound(de.uni_due.inf.ti.graph.GraphElement element)
Gets the active min bound of a graph element
|
java.util.List<java.lang.Integer> |
getMinBounds(de.uni_due.inf.ti.graph.GraphElement element)
Gets the list of min bounds of a graph element
|
java.util.List<java.util.HashMap<de.uni_due.inf.ti.graph.GraphElement,AnnotationBounds>> |
getMultiplicities()
Gets a list of multiplicities for the multiply annotated type graph
|
de.uni_due.inf.ti.graph.Node |
getNodeByID(int id)
Gets a node in this graph based on an ID
|
int |
getNumberOfMultiplicities()
Returns the number of multiplicities stored in the annotation set of this multiply annotated type graph
|
de.uni_due.inf.ti.graph.Edge |
reAddAnnotatedEdge(de.uni_due.inf.ti.graph.Label label,
java.util.List<de.uni_due.inf.ti.graph.Node> nodes) |
void |
removeAnnotatedEdge(de.uni_due.inf.ti.graph.Edge edge)
Removes an edge from the graph
|
boolean |
removeMultiplicity(int index)
Removes a multiplicity from the set of annotations for this multiply annotated type graph
|
AnnotatedTypeGraph |
selectMultiplicity(int n)
Returns the annotated type graph with the n-th multiplicity stored in the set of multiplicities
or the current annotated type graph if the position is undefined.
|
void |
setLimit(int limit)
Sets the limit of this graph
|
addEdge, addEdge, addNode, addNodes, getAddCount, getDelCount, getEdges, getInclusion, getInclusion, getInclusions, getInducedInclusion, getIsoHash, getIsolatedNodes, getModCount, getNextNodeId, getNodes, getSignature, getSubgraphs, isBinary, isDiscrete, isEmpty, isIsomorphic, mergeNodes, mergeNodes, removeEdge, removeNode, toString, toString, weaklyConnectedClosure, weaklyConnectedClosure
public AnnotatedTypeGraph()
public AnnotatedTypeGraph(java.lang.String name)
name
- The name of the annotated type graphpublic AnnotatedTypeGraph(AnnotatedTypeGraph orig)
orig
- the graph of which the new graph must be a copyjava.lang.NullPointerException
- if orig
is null
public AnnotatedTypeGraph(de.uni_due.inf.ti.graph.Graph orig)
orig
- the graph of which the new graph must be a copyjava.lang.NullPointerException
- if orig
is null
public AnnotatedTypeGraph clone()
clone
in class de.uni_due.inf.ti.graph.Graph
public de.uni_due.inf.ti.graph.Node addStandardAnnotatedNode()
public de.uni_due.inf.ti.graph.Node addAnnotatedNode(AnnotationBounds bounds)
bounds
- The bounds to be set for the new nodepublic de.uni_due.inf.ti.graph.Node addAnnotatedNode(int min, int max)
min
- The minimal bound to be set for the new nodemax
- The maximal bound to be set for the new nodepublic de.uni_due.inf.ti.graph.Edge addStandardAnnotatedEdge(de.uni_due.inf.ti.graph.Label label, de.uni_due.inf.ti.graph.Node... nodes)
label
- The edge label to be usednodes
- The nodes incident to this edgepublic de.uni_due.inf.ti.graph.Edge addAnnotatedEdge(de.uni_due.inf.ti.graph.Label label, AnnotationBounds bounds, de.uni_due.inf.ti.graph.Node... nodes)
label
- The edge label to be usedbounds
- The annotation bounds of the edgenodes
- The nodes incident to this edgepublic de.uni_due.inf.ti.graph.Edge addAnnotatedEdge(de.uni_due.inf.ti.graph.Label label, AnnotationBounds bounds, java.util.List<de.uni_due.inf.ti.graph.Node> nodes)
label
- The edge label to be usedbounds
- The annotation bounds of the edgenodes
- The list of nodes incident to this edgepublic de.uni_due.inf.ti.graph.Edge addAnnotatedEdge(de.uni_due.inf.ti.graph.Label label, int min, int max, de.uni_due.inf.ti.graph.Node... nodes)
label
- The edge label to be usedmin
- The minimal annotation boundmax
- The maximal annotation boundnodes
- The nodes incident to the edgepublic de.uni_due.inf.ti.graph.Edge addAnnotatedEdge(de.uni_due.inf.ti.graph.Label label, int min, int max, java.util.List<de.uni_due.inf.ti.graph.Node> nodes)
label
- The edge label to be usedmin
- The minimal annotation boundmax
- The maximal annotation boundnodes
- The list of nodes incident to the edgepublic void removeAnnotatedEdge(de.uni_due.inf.ti.graph.Edge edge)
edge
- The edge to be removedpublic de.uni_due.inf.ti.graph.Edge reAddAnnotatedEdge(de.uni_due.inf.ti.graph.Label label, java.util.List<de.uni_due.inf.ti.graph.Node> nodes)
public AnnotationBounds getAnnotationBounds(de.uni_due.inf.ti.graph.GraphElement element)
element
- The graph element whose active annotation bound is asked forpublic int getMinBound(de.uni_due.inf.ti.graph.GraphElement element)
element
- The graph element whose minimal bound is asked forpublic java.util.List<java.lang.Integer> getMinBounds(de.uni_due.inf.ti.graph.GraphElement element)
element
- The graph element whose minimal bounds is asked forpublic int getMaxBound(de.uni_due.inf.ti.graph.GraphElement element)
element
- The graph element whose maximal bound is asked forpublic java.util.List<java.lang.Integer> getMaxBounds(de.uni_due.inf.ti.graph.GraphElement element)
element
- The graph element whose maximal bounds is asked forpublic java.lang.String getBoundLabel(de.uni_due.inf.ti.graph.GraphElement element)
element
- The graph element whose bounds are asked forpublic int getLimit()
public void setLimit(int limit)
limit
- The limit to be usedpublic java.util.HashMap<de.uni_due.inf.ti.graph.GraphElement,AnnotationBounds> getCurrentMultiplicity()
public de.uni_due.inf.ti.graph.Node getNodeByID(int id)
id
- The ID of the node to be returnedpublic java.util.List<de.uni_due.inf.ti.graph.Edge> getEdgeList()
public java.util.List<java.util.HashMap<de.uni_due.inf.ti.graph.GraphElement,AnnotationBounds>> getMultiplicities()
public boolean addMultiplicity(java.util.HashMap<de.uni_due.inf.ti.graph.GraphElement,AnnotationBounds> multiplicity)
multiplicity
- the multiplicity to be added to the set of multiplicitiespublic boolean removeMultiplicity(int index)
index
- the multiplicity index to be removedpublic AnnotatedTypeGraph selectMultiplicity(int n)
n
- position of the multiplicitypublic int getNumberOfMultiplicities()
public int getActiveMultiplicityIndex()
public de.uni_due.inf.ti.graph.Node getCopiedNode(de.uni_due.inf.ti.graph.Node orig)
orig
- The original node that was copied