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

Class Graph

java.lang.Object

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

public class Graph
extends Object

A class for a directed graph. Implemented by an adjacency list representation of a graph.

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)
List<BpmnElement>	getAdjacencyListPredecessor(BpmnElement element)
List<BpmnElement>	getAdjacencyListSuccessor(BpmnElement element)
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()
LinkedHashMap<BpmnElement,VertexInfo>	getVertexInfo()
Collection<BpmnElement>	getVertices()
boolean	hasEdge(BpmnElement from, BpmnElement to)
void	removeEdge(BpmnElement from, BpmnElement to)
String	toString()

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

addStartNode

public void addStartNode(BpmnElement node)

getStartNodes

public Collection<BpmnElement> getStartNodes()

addEndNode

public void addEndNode(BpmnElement node)

getEndNodes

public Collection<BpmnElement> getEndNodes()

addVertex

public void addVertex(BpmnElement v)

getVertexInfo

public LinkedHashMap<BpmnElement,VertexInfo> getVertexInfo()

getVertices

public Collection<BpmnElement> getVertices()

getEdges

public Collection<List<Edge>> getEdges()

getAdjacencyListPredecessor

public List<BpmnElement> getAdjacencyListPredecessor(BpmnElement element)

getAdjacencyListSuccessor

public List<BpmnElement> getAdjacencyListSuccessor(BpmnElement element)

addEdge

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

removeEdge

public void removeEdge(BpmnElement from,
                       BpmnElement to)

hasEdge

public boolean hasEdge(BpmnElement from,
                       BpmnElement to)

getEdge

public Edge getEdge(BpmnElement from,
                    BpmnElement to)

getNodesWithAnomalies

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

Get nodes with data flow anomalies

Returns:

Map of elements with anomalies

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

Parameters:

source - BpmnElement

anomaly - AnomalyContainer

Returns:

List of invalid paths

toString

public String toString()

Overrides:

toString in class Object