Class CausalGraph<N extends org.processmining.models.graphbased.directed.DirectedGraphNode,E extends org.processmining.models.graphbased.directed.DirectedGraphEdge<? extends N,? extends N>>
- java.lang.Object
-
- org.processmining.models.graphbased.AbstractGraphElement
-
- org.processmining.models.graphbased.AbstractGraph
-
- org.processmining.models.graphbased.directed.AbstractDirectedGraph<N,E>
-
- org.processmining.extendedhybridminer.models.causalgraph.CausalGraph<N,E>
-
- All Implemented Interfaces:
java.lang.Cloneable,java.lang.Comparable<org.processmining.models.graphbased.directed.DirectedGraph<N,E>>,org.processmining.models.graphbased.AttributeMapOwner,org.processmining.models.graphbased.directed.DirectedGraph<N,E>,org.processmining.models.graphbased.directed.DirectedGraphElement
- Direct Known Subclasses:
ExtendedCausalGraph
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>Created by demas on 27/07/16.
-
-
Constructor Summary
Constructors Constructor Description CausalGraph()CausalGraph(java.util.LinkedHashSet<N> nodes)CausalGraph(java.util.LinkedHashSet<N> nodes, java.util.LinkedHashSet<E> edges)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description voidaddEdge(E edge)protected NaddNode(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())booleanequals(java.lang.Object o)java.util.LinkedHashSet<E>getEdges()protected org.processmining.models.graphbased.directed.AbstractDirectedGraph<N,E>getEmptyClone()java.util.Set<N>getNodes()inthashCode()voidremoveEdge(org.processmining.models.graphbased.directed.DirectedGraphEdge edge)Removes the given edge from the graph.voidremoveNode(org.processmining.models.graphbased.directed.DirectedGraphNode cell)-
Methods inherited from class org.processmining.models.graphbased.directed.AbstractDirectedGraph
checkAddEdge, compareTo, getGraph, getInEdges, getOutEdges, graphElementAdded, graphElementChanged, graphElementRemoved, removeSurroundingEdges
-
Methods inherited from class org.processmining.models.graphbased.AbstractGraph
getEdges, removeFromEdges, removeNodeFromCollection
-
Methods inherited from class org.processmining.models.graphbased.AbstractGraphElement
getAttributeMap, getLabel, toString
-
Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
-
-
-
-
Method Detail
-
getEmptyClone
protected org.processmining.models.graphbased.directed.AbstractDirectedGraph<N,E> getEmptyClone()
-
cloneFrom
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)
Description copied from class:org.processmining.models.graphbased.directed.AbstractDirectedGraphThe returned mapping satisfies: map.keySet().containsAll(graph.getNodes()) and map.keySet().containsAll(graph.getEdges())
-
removeEdge
public void removeEdge(org.processmining.models.graphbased.directed.DirectedGraphEdge edge)
Description copied from interface:org.processmining.models.graphbased.directed.DirectedGraphRemoves the given edge from the graph.- Specified by:
removeEdgein interfaceorg.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>>- Specified by:
removeEdgein classorg.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>>
-
getNodes
public java.util.Set<N> getNodes()
-
getEdges
public java.util.LinkedHashSet<E> getEdges()
-
removeNode
public void removeNode(org.processmining.models.graphbased.directed.DirectedGraphNode cell)
-
equals
public boolean equals(java.lang.Object o)
- Specified by:
equalsin interfaceorg.processmining.models.graphbased.directed.DirectedGraphElement- Overrides:
equalsin classorg.processmining.models.graphbased.AbstractGraph
-
hashCode
public int hashCode()
- Specified by:
hashCodein interfaceorg.processmining.models.graphbased.directed.DirectedGraphElement- Overrides:
hashCodein classorg.processmining.models.graphbased.AbstractGraph
-
addEdge
public void addEdge(E edge)
-
-