com.qbpsimulator.engine.utils

Class Graph

java.lang.Object

com.qbpsimulator.engine.utils.Graph

public class Graph
extends Object

Implementation of Graph handling

Author:

Madis Abel

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
class	Graph.Edge

Constructor Summary

Constructors

Constructor and Description
Graph()

Method Summary

Modifier and Type	Method and Description
void	addEdge(Integer source, Integer target, String edgeName) Add an edge to the graphs
Integer	addVertex(String name) Add a new vertex to the Graph
boolean	containsEdge(Integer source, Integer target) Returns whether graph contains an edge from source to target vertex
Set<Graph.Edge>	getIncomingEdges(Integer vertexIndex) Returns set of incoming edges to vertex
Set<Graph.Edge>	getOutgoingEdges(Integer vertexIndex) Returns set of outgoing edges from vertex
Set<Integer>	getSourceNodes() Gets set of vertex indexes which do not have any incoming edges
int	getVerticeCount() Returns count of vertices in the graph
boolean	isJoin(Integer vertexIndex) Returns whether an vertex has more than one incoming edge
boolean	isSplit(Integer vertexIndex) Returns whether an vertex has more than one outgoing edge

Methods inherited from class java.lang.Object

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

Constructor Detail

Graph

public Graph()

Method Detail

addVertex

public Integer addVertex(String name)
                  throws ProcessValidationException

Add a new vertex to the Graph

Parameters:

name - name of the vertex

Returns:

integer ID of the vertex added

Throws:

ProcessValidationException

addEdge

public void addEdge(Integer source,
                    Integer target,
                    String edgeName)

Add an edge to the graphs

Parameters:

source - source vertex

target - targe vertex

edgeName - name of the edge

containsEdge

public boolean containsEdge(Integer source,
                            Integer target)

Returns whether graph contains an edge from source to target vertex

Parameters:

source - vertex index

target - vertex index

Returns:

getVerticeCount

public int getVerticeCount()

Returns count of vertices in the graph

Returns:

getIncomingEdges

public Set<Graph.Edge> getIncomingEdges(Integer vertexIndex)

Returns set of incoming edges to vertex

Parameters:

vertexIndex - index of vertex

Returns:

getOutgoingEdges

public Set<Graph.Edge> getOutgoingEdges(Integer vertexIndex)

Returns set of outgoing edges from vertex

Parameters:

vertexIndex - index of vertex

Returns:

getSourceNodes

public Set<Integer> getSourceNodes()

Gets set of vertex indexes which do not have any incoming edges

Returns:

list of vertex indexes

isSplit

public boolean isSplit(Integer vertexIndex)

Returns whether an vertex has more than one outgoing edge

Parameters:

vertexIndex - index of vertex

Returns:

isJoin

public boolean isJoin(Integer vertexIndex)

Returns whether an vertex has more than one incoming edge

Parameters:

vertexIndex - index of vertex

Returns: