public class PartialOrder extends org.processmining.models.graphbased.directed.AbstractDirectedGraph<Node,Edge>
| Modifier and Type | Field and Description |
|---|---|
protected java.util.Set<Edge> |
edges |
protected java.util.Set<Node> |
nodes |
| Constructor and Description |
|---|
PartialOrder() |
PartialOrder(int traceIndex,
java.lang.String name) |
| Modifier and Type | Method and Description |
|---|---|
void |
addEdge(Node sourceNode,
Node targetNode,
EdgeType type) |
void |
addNode(Node node) |
java.util.HashMap<java.lang.String,java.lang.Number> |
buildShortestPaths() |
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<Node,Edge> graph)
The returned mapping satisfies:
map.keySet().containsAll(graph.getNodes()) and
map.keySet().containsAll(graph.getEdges())
|
java.util.Set<Edge> |
getEdges() |
protected org.processmining.models.graphbased.directed.AbstractDirectedGraph<Node,Edge> |
getEmptyClone() |
Node |
getEndingNode() |
java.lang.String |
getName() |
Node |
getNodeByKeyAndEventIndex(long eventKey,
int eventIndex) |
Node |
getNodeByKeyAndLabel(long eventKey,
java.lang.String eventLabel) |
Node |
getNodeLabelAndCardinality(java.lang.String label,
int cardinality) |
java.util.Set<Node> |
getNodes() |
java.util.HashMap<java.lang.String,java.lang.Number> |
getNodeShortestPaths(Node node) |
java.util.HashMap<java.lang.String,java.lang.Number> |
getShortestPaths() |
Node |
getStartingNode() |
int |
getTraceIndex() |
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, removeSurroundingEdgesequals, getEdges, hashCode, removeFromEdges, removeNodeFromCollectiongetAttributeMap, getLabel, toStringclone, equals, finalize, getClass, notify, notifyAll, wait, wait, waitpublic PartialOrder(int traceIndex,
java.lang.String name)
public PartialOrder()
public void addNode(Node node)
public void removeNode(org.processmining.models.graphbased.directed.DirectedGraphNode cell)
protected org.processmining.models.graphbased.directed.AbstractDirectedGraph<Node,Edge> 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<Node,Edge> graph)
org.processmining.models.graphbased.directed.AbstractDirectedGraphpublic void removeEdge(org.processmining.models.graphbased.directed.DirectedGraphEdge edge)
org.processmining.models.graphbased.directed.DirectedGraphpublic java.util.HashMap<java.lang.String,java.lang.Number> buildShortestPaths()
public java.util.HashMap<java.lang.String,java.lang.Number> getNodeShortestPaths(Node node)
public java.util.Set<Node> getNodes()
public java.util.Set<Edge> getEdges()
public int getTraceIndex()
public java.util.HashMap<java.lang.String,java.lang.Number> getShortestPaths()
public Node getStartingNode()
public Node getEndingNode()
public java.lang.String getName()
public Node getNodeByKeyAndLabel(long eventKey, java.lang.String eventLabel)
public Node getNodeByKeyAndEventIndex(long eventKey, int eventIndex)
public Node getNodeLabelAndCardinality(java.lang.String label, int cardinality)