com.ds.bpm.bpd.xml

类 GraphChecker

java.lang.Object

com.ds.bpm.bpd.xml.GraphChecker

public class GraphChecker
extends Object

You can use this class to check if the graph is cyclic, or to find index of corresponding join node for the given split node index. When constructing class, you have to pass it the incidence matrix, which has to be the two-dimensional array of booleans , where the rows and column indexes represents the graph node indexes, and values represents if there is a connection between these nodes. If there is connection from node i to the node j it is represented by putting true into j'th column of the i'th row.

构造器概要

构造器

构造器和说明
GraphChecker(boolean[][] matParam) Constructs the GraphChecker object.

方法概要

限定符和类型	方法和说明
int[]	getCyclicNodes()
int	getJoinIndex(int nodeX) Returns index of corresponding join node for the given split node index.
boolean	isGraphCyclic()

从类继承的方法 java.lang.Object

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

构造器详细资料

GraphChecker

public GraphChecker(boolean[][] matParam)

Constructs the GraphChecker object.

参数:

matParam - The two dimensional array of booleans representing the graphs incidence matrix.

方法详细资料

isGraphCyclic

public boolean isGraphCyclic()

返回:

true if the graph is cyclic, and false otherwise.

getCyclicNodes

public int[] getCyclicNodes()

返回:

The array of graph node indexes that are within some graph cycle. If the graph is not cyclic, returns null.

getJoinIndex

public int getJoinIndex(int nodeX)

Returns index of corresponding join node for the given split node index.

参数:

nodeX - The index of split node

返回:

Index of corresponding join node if it exists, -1 otherwise.