public abstract class CausalGraph<N extends org.processmining.models.graphbased.directed.DirectedGraphNode,E extends org.processmining.models.graphbased.directed.DirectedGraphEdge<? extends N,? extends N>>
extends org.processmining.models.graphbased.directed.AbstractDirectedGraph<N,E>
Constructor and Description |
---|
CausalGraph() |
CausalGraph(java.util.Set<N> nodes) |
CausalGraph(java.util.Set<N> nodes,
java.util.Set<E> edges) |
Modifier and Type | Method and Description |
---|---|
void |
addEdge(E edge) |
protected N |
addNode(N node) |
protected java.util.Map<? extends org.processmining.models.graphbased.directed.DirectedGraphElement,? extends org.processmining.models.graphbased.directed.DirectedGraphElement> |
cloneFrom(org.processmining.models.graphbased.directed.DirectedGraph<N,E> graph)
The returned mapping satisfies:
map.keySet().containsAll(graph.getNodes()) and
map.keySet().containsAll(graph.getEdges())
|
boolean |
equals(java.lang.Object o) |
java.util.Set<E> |
getEdges() |
protected org.processmining.models.graphbased.directed.AbstractDirectedGraph<N,E> |
getEmptyClone() |
java.util.Set<N> |
getNodes() |
int |
hashCode() |
void |
removeEdge(org.processmining.models.graphbased.directed.DirectedGraphEdge edge)
Removes the given edge from the graph.
|
void |
removeNode(org.processmining.models.graphbased.directed.DirectedGraphNode cell) |
checkAddEdge, compareTo, getGraph, getInEdges, getOutEdges, graphElementAdded, graphElementChanged, graphElementRemoved, removeSurroundingEdges
getEdges, removeFromEdges, removeNodeFromCollection
getAttributeMap, getLabel, toString
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
public CausalGraph()
public CausalGraph(java.util.Set<N> nodes)
protected org.processmining.models.graphbased.directed.AbstractDirectedGraph<N,E> getEmptyClone()
protected java.util.Map<? extends org.processmining.models.graphbased.directed.DirectedGraphElement,? extends org.processmining.models.graphbased.directed.DirectedGraphElement> cloneFrom(org.processmining.models.graphbased.directed.DirectedGraph<N,E> graph)
org.processmining.models.graphbased.directed.AbstractDirectedGraph
public void removeEdge(org.processmining.models.graphbased.directed.DirectedGraphEdge edge)
org.processmining.models.graphbased.directed.DirectedGraph
removeEdge
in interface org.processmining.models.graphbased.directed.DirectedGraph<N extends org.processmining.models.graphbased.directed.DirectedGraphNode,E extends org.processmining.models.graphbased.directed.DirectedGraphEdge<? extends N,? extends N>>
removeEdge
in class org.processmining.models.graphbased.directed.AbstractDirectedGraph<N extends org.processmining.models.graphbased.directed.DirectedGraphNode,E extends org.processmining.models.graphbased.directed.DirectedGraphEdge<? extends N,? extends N>>
public java.util.Set<N> getNodes()
public java.util.Set<E> getEdges()
public void removeNode(org.processmining.models.graphbased.directed.DirectedGraphNode cell)
public boolean equals(java.lang.Object o)
equals
in interface org.processmining.models.graphbased.directed.DirectedGraphElement
equals
in class org.processmining.models.graphbased.AbstractGraph
public int hashCode()
hashCode
in interface org.processmining.models.graphbased.directed.DirectedGraphElement
hashCode
in class org.processmining.models.graphbased.AbstractGraph
public void addEdge(E edge)