Package org.processmining.lip.model

Class DAGraphImpl<T extends TNode>

java.lang.Object

org.processmining.lip.model.DAGraphImpl<T>

All Implemented Interfaces:

DAGraph<T>

public class DAGraphImpl<T extends TNode>
extends java.lang.Object
implements DAGraph<T>

Constructor Summary

Constructors

Constructor	Description
DAGraphImpl(java.util.List<T> collection, boolean[][] directlyCauses)	This constructor create a directed acyclic graph and deduce eventually follows relation from directlyCauses
DAGraphImpl(java.util.List<T> collection, boolean[][] directlyCauses, boolean[][] eventuallyCauses)

Method Summary

Modifier and Type	Method	Description
static boolean[][]	computeEventuallyWarshall(boolean[][] directlyCauses)
java.util.List<T>	getConcurrentNodes(T node)
java.util.List<T>	getDirectlyPredecessors(T node)
java.util.List<T>	getDirectlySuccessors(T node)
java.util.List<T>	getEventuallyPredecessors(T node)
java.util.List<T>	getEventuallySuccessors(T node)
java.util.Set<T>	getNodes()
boolean	isDirectlyCauses(T source, T target)
boolean	isEventuallyCauses(T source, T target)
DAGraph<T>	projectOn(java.util.List<T> nodes)	Creates a new DAGraph, projects this DAGraph on the set of nodes, and copies directly-follows and eventually-follows relations of the nodes.

Methods inherited from class java.lang.Object

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

Constructor Detail

DAGraphImpl

public DAGraphImpl(java.util.List<T> collection,
                   boolean[][] directlyCauses)

This constructor create a directed acyclic graph and deduce eventually follows relation from directlyCauses

Parameters:

collection -

directlyCauses -

DAGraphImpl

public DAGraphImpl(java.util.List<T> collection,
                   boolean[][] directlyCauses,
                   boolean[][] eventuallyCauses)

Method Detail

projectOn

public DAGraph<T> projectOn(java.util.List<T> nodes)

Creates a new DAGraph, projects this DAGraph on the set of nodes, and copies directly-follows and eventually-follows relations of the nodes.

Specified by:

projectOn in interface DAGraph<T extends TNode>

computeEventuallyWarshall

public static boolean[][] computeEventuallyWarshall(boolean[][] directlyCauses)

getNodes

public java.util.Set<T> getNodes()

Specified by:

getNodes in interface DAGraph<T extends TNode>

getConcurrentNodes

public java.util.List<T> getConcurrentNodes(T node)

Specified by:

getConcurrentNodes in interface DAGraph<T extends TNode>

getDirectlyPredecessors

public java.util.List<T> getDirectlyPredecessors(T node)

Specified by:

getDirectlyPredecessors in interface DAGraph<T extends TNode>

getEventuallyPredecessors

public java.util.List<T> getEventuallyPredecessors(T node)

Specified by:

getEventuallyPredecessors in interface DAGraph<T extends TNode>

getDirectlySuccessors

public java.util.List<T> getDirectlySuccessors(T node)

Specified by:

getDirectlySuccessors in interface DAGraph<T extends TNode>

getEventuallySuccessors

public java.util.List<T> getEventuallySuccessors(T node)

Specified by:

getEventuallySuccessors in interface DAGraph<T extends TNode>

isDirectlyCauses

public boolean isDirectlyCauses(T source,
                                T target)

Specified by:

isDirectlyCauses in interface DAGraph<T extends TNode>

isEventuallyCauses

public boolean isEventuallyCauses(T source,
                                  T target)

Specified by:

isEventuallyCauses in interface DAGraph<T extends TNode>