org.processmining.fuzzyminer.models.causalgraph

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.fuzzyminer.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:

FuzzyCausalGraph

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.

Field Summary

Fields inherited from class org.processmining.models.graphbased.AbstractGraph

id

Constructor Summary

Constructors

Constructor and Description
CausalGraph()
CausalGraph(java.util.Set<N> nodes)
CausalGraph(java.util.Set<N> nodes, java.util.Set<E> edges)

Method Summary

Methods

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)

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

Methods inherited from interface org.processmining.models.graphbased.directed.DirectedGraphElement

getLabel

Methods inherited from interface org.processmining.models.graphbased.AttributeMapOwner

getAttributeMap

Constructor Detail

CausalGraph

public CausalGraph()

CausalGraph

public CausalGraph(java.util.Set<N> nodes)

CausalGraph

public CausalGraph(java.util.Set<N> nodes,
           java.util.Set<E> edges)

Method Detail

getEmptyClone

protected org.processmining.models.graphbased.directed.AbstractDirectedGraph<N,E> getEmptyClone()

Specified by:

getEmptyClone 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>>

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.AbstractDirectedGraph

The returned mapping satisfies: map.keySet().containsAll(graph.getNodes()) and map.keySet().containsAll(graph.getEdges())

Specified by:

cloneFrom 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>>

Returns:

removeEdge

public void removeEdge(org.processmining.models.graphbased.directed.DirectedGraphEdge edge)

Description copied from interface: org.processmining.models.graphbased.directed.DirectedGraph

Removes the given edge from the graph.

Specified by:

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>>

Specified by:

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>>

getNodes

public java.util.Set<N> getNodes()

getEdges

public java.util.Set<E> getEdges()

removeNode

public void removeNode(org.processmining.models.graphbased.directed.DirectedGraphNode cell)

equals

public boolean equals(java.lang.Object o)

Specified by:

equals in interface org.processmining.models.graphbased.directed.DirectedGraphElement

Overrides:

equals in class org.processmining.models.graphbased.AbstractGraph

hashCode

public int hashCode()

Specified by:

hashCode in interface org.processmining.models.graphbased.directed.DirectedGraphElement

Overrides:

hashCode in class org.processmining.models.graphbased.AbstractGraph

addNode

protected N addNode(N node)

addEdge

public void addEdge(E edge)