de.viadee.bpm.vPAV.processing.model.graph

Class Graph

java.lang.Object

de.viadee.bpm.vPAV.processing.model.graph.Graph

All Implemented Interfaces:

IGraph

public class Graph
extends Object
implements IGraph

Constructor Summary

Constructors

Constructor and Description
Graph(String processId)

Method Summary

Modifier and Type	Method and Description
void	addEdge(BpmnElement from, BpmnElement to, int weight)
void	addEndNode(BpmnElement node)
void	addStartNode(BpmnElement node)
void	addVertex(BpmnElement v)
protected void	clearVertexInfo()
List<Path>	getAllInvalidPaths(BpmnElement source, AnomalyContainer anomaly) search all paths with variables, which has not been set source: http://codereview.stackexchange.com/questions/45678/find-all-paths-from-source-to-destination
Edge	getEdge(BpmnElement from, BpmnElement to)
Collection<List<Edge>>	getEdges()
Collection<BpmnElement>	getEndNodes()
Map<BpmnElement,List<AnomalyContainer>>	getNodesWithAnomalies() get nodes with data flow anomalies
String	getProcessId()
Collection<BpmnElement>	getStartNodes()
Collection<BpmnElement>	getVertices()
boolean	hasEdge(BpmnElement from, BpmnElement to)
static Map<String,InOutState>	intersection(Map<String,InOutState> mapA, Map<String,InOutState> mapB) generate intersection for variable maps and remind precedence rule for variable states
void	removeEdge(BpmnElement from, BpmnElement to)
void	setAnomalyInformation(BpmnElement source) set anomaly information on data flow graph
String	toString()
static Map<String,InOutState>	unionWithStatePrecedence(Map<String,InOutState> mapA, Map<String,InOutState> mapB) get union and remind precedence rule for variable states

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

Graph

public Graph(String processId)

Method Detail

getProcessId

public String getProcessId()

Specified by:

getProcessId in interface IGraph

addStartNode

public void addStartNode(BpmnElement node)

Specified by:

addStartNode in interface IGraph

getStartNodes

public Collection<BpmnElement> getStartNodes()

Specified by:

getStartNodes in interface IGraph

addEndNode

public void addEndNode(BpmnElement node)

Specified by:

addEndNode in interface IGraph

getEndNodes

public Collection<BpmnElement> getEndNodes()

Specified by:

getEndNodes in interface IGraph

addVertex

public void addVertex(BpmnElement v)

Specified by:

addVertex in interface IGraph

getVertices

public Collection<BpmnElement> getVertices()

Specified by:

getVertices in interface IGraph

getEdges

public Collection<List<Edge>> getEdges()

Specified by:

getEdges in interface IGraph

addEdge

public void addEdge(BpmnElement from,
                    BpmnElement to,
                    int weight)

Specified by:

addEdge in interface IGraph

removeEdge

public void removeEdge(BpmnElement from,
                       BpmnElement to)

Specified by:

removeEdge in interface IGraph

hasEdge

public boolean hasEdge(BpmnElement from,
                       BpmnElement to)

Specified by:

hasEdge in interface IGraph

getEdge

public Edge getEdge(BpmnElement from,
                    BpmnElement to)

Specified by:

getEdge in interface IGraph

setAnomalyInformation

public void setAnomalyInformation(BpmnElement source)

set anomaly information on data flow graph

Specified by:

setAnomalyInformation in interface IGraph

getNodesWithAnomalies

public Map<BpmnElement,List<AnomalyContainer>> getNodesWithAnomalies()

get nodes with data flow anomalies

Specified by:

getNodesWithAnomalies in interface IGraph

getAllInvalidPaths

public List<Path> getAllInvalidPaths(BpmnElement source,
                                     AnomalyContainer anomaly)

search all paths with variables, which has not been set source: http://codereview.stackexchange.com/questions/45678/find-all-paths-from-source-to-destination

Specified by:

getAllInvalidPaths in interface IGraph

toString

public String toString()

Specified by:

toString in interface IGraph

Overrides:

toString in class Object

clearVertexInfo

protected final void clearVertexInfo()

intersection

public static Map<String,InOutState> intersection(Map<String,InOutState> mapA,
                                                  Map<String,InOutState> mapB)

generate intersection for variable maps and remind precedence rule for variable states

Parameters:

mapA - mapA

mapB - mapB

Returns:

intersection

unionWithStatePrecedence

public static Map<String,InOutState> unionWithStatePrecedence(Map<String,InOutState> mapA,
                                                              Map<String,InOutState> mapB)

get union and remind precedence rule for variable states

Parameters:

mapA - mapA

mapB - mapB

Returns:

union