org.processmining.BigData.common.models

Class Graph

java.lang.Object

org.processmining.BigData.common.models.Graph

Direct Known Subclasses:

HadoopGraph

public class Graph
extends java.lang.Object

Class representing a graph. The class provides basic operations to creates graphs representing some type of relation between the activities of an event log. Example of graphs that can be represented using this class are: - DFG (Directly-follows-graph), - L2L (length-two loops graphs) or - LD (long-distance relations graph) The format of the graph when it is written into disk is the following: FIRST ROW (Activities): Activities in the graph (sorted by name) SECOND ROW (Start activities): Number of times an activity is the initial activity in a trace THIRD ROW (End activities): Number of times an activity is the final activity in a trace FOURTH ROW IN ADVANCE (Matrix/Graph): There is a row for each activity in the graph. Each row represents the number of times the activity is related to all activities in the log.

Author:

shernandez

Field Summary

Fields

Modifier and Type	Field and Description
protected java.lang.String	DELIMITER
protected java.util.HashMap<java.lang.String,java.lang.Long>	end
protected java.util.HashMap<java.lang.String,java.util.HashMap<java.lang.String,java.lang.Long>>	matrix
protected java.util.HashMap<java.lang.String,java.lang.Long>	start

Constructor Summary

Constructors

Constructor and Description
Graph() Creates data structures to store the graph

Method Summary

Modifier and Type	Method and Description
void	add(Graph graph) Add data from the parameter graph to the actual graph
void	addNEvents(long n) Add 'n' to the actual number of events
void	addNTraces(long n) Add 'n' to the actual number of traces
void	countActivitiesRelation(java.lang.String[] predecessor, java.lang.String[] successor) Count the new relation (edge) in the graph.
void	countActivitiesRelation(java.lang.String predecessor, java.lang.String successor) Count the new relation (edge) in the graph
protected void	countEdge(java.lang.String[] predecessor, java.lang.String[] successor, java.lang.Long n) Count a new occurrence of the directly follows edge between the two activities
protected void	countEdge(java.lang.String predecessor, java.lang.String successor, java.lang.Long n) Count a new occurrence of the directly follows edge between the two activities
protected void	countEnd(java.lang.String[] activity, java.lang.Long n) Count a new occurrence of the activity being the last one in a trace
protected void	countEnd(java.lang.String activity, java.lang.Long n) Count a new occurrence of the activity being the last one in a trace
protected void	countStart(java.lang.String[] activity, java.lang.Long n) Count a new occurrence of the activity being the first one in a trace
protected void	countStart(java.lang.String activity, java.lang.Long n) Count a new occurrence of the activity being the first one in a trace
java.util.Set<java.lang.String>	getAllActivities() Get all the activities in the DFG
java.lang.Long	getCount(java.lang.String predecessor, java.lang.String successor) Return the number of times the predecessor is directly followed by the successor
java.util.Set<java.lang.String>	getEndActivities() Get end activities in the DFG.
java.lang.Long	getEndCount(java.lang.String activity) Return the number of times the activity ends a trace
long	getNEvents() Getter for n_events
long	getNTraces() Getter for n_traces
java.util.Set<java.lang.String>	getStartActivities() Get start activities in the DFG.
java.lang.Long	getStartCount(java.lang.String activity) Return the number of times the activity starts a trace
java.lang.Long	getTotalCount(java.lang.String activity) Return the total count (number of appearances) of this activity (end+output_edges)
boolean	read(java.lang.String filename) Read a graph from an input file
void	setNEvents(long n) Setter for n_events
void	setNTraces(long n) Setter for n_traces
java.lang.String	toString()
void	write() Write the graph in the standard output
void	write(java.lang.String output_filename) Write the graph in the specified file

Methods inherited from class java.lang.Object

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

Field Detail

DELIMITER

protected final java.lang.String DELIMITER

See Also:

Constant Field Values

start

protected java.util.HashMap<java.lang.String,java.lang.Long> start

end

protected java.util.HashMap<java.lang.String,java.lang.Long> end

matrix

protected java.util.HashMap<java.lang.String,java.util.HashMap<java.lang.String,java.lang.Long>> matrix

Constructor Detail

Graph

public Graph()

Creates data structures to store the graph

Method Detail

add

public void add(Graph graph)

Add data from the parameter graph to the actual graph

Parameters:

graph - Directly-follows graph

countActivitiesRelation

public void countActivitiesRelation(java.lang.String[] predecessor,
                                    java.lang.String[] successor)

Count the new relation (edge) in the graph.

Parameters:

predecessor - predecessor activity (Compose name)

successor - successor activity (Compose name)

countActivitiesRelation

public void countActivitiesRelation(java.lang.String predecessor,
                                    java.lang.String successor)

Count the new relation (edge) in the graph

Parameters:

predecessor - predecessor activity

successor - successor activity

setNEvents

public void setNEvents(long n)

Setter for n_events

Parameters:

n - Number of events

addNEvents

public void addNEvents(long n)

Add 'n' to the actual number of events

Parameters:

n - Number of events to add

getNEvents

public long getNEvents()

Getter for n_events

Returns:

Number of events treated

setNTraces

public void setNTraces(long n)

Setter for n_traces

Parameters:

n - Number of traces

addNTraces

public void addNTraces(long n)

Add 'n' to the actual number of traces

Parameters:

n - Number of traces to add

getNTraces

public long getNTraces()

Getter for n_traces

Returns:

Number of traces treated

getTotalCount

public java.lang.Long getTotalCount(java.lang.String activity)

Return the total count (number of appearances) of this activity (end+output_edges)

Parameters:

activity - Activity

Returns:

The total count (number of appearances) of this activity (end+output_edges)

getStartActivities

public java.util.Set<java.lang.String> getStartActivities()

Get start activities in the DFG.

Returns:

Set of activities

getEndActivities

public java.util.Set<java.lang.String> getEndActivities()

Get end activities in the DFG.

Returns:

Set of activities

getAllActivities

public java.util.Set<java.lang.String> getAllActivities()

Get all the activities in the DFG

Returns:

Set of activities

getStartCount

public java.lang.Long getStartCount(java.lang.String activity)

Return the number of times the activity starts a trace

Parameters:

activity - Start activity

Returns:

the number of times the activity starts a trace

getEndCount

public java.lang.Long getEndCount(java.lang.String activity)

Return the number of times the activity ends a trace

Parameters:

activity - Start activity

Returns:

the number of times the activity ends a trace

getCount

public java.lang.Long getCount(java.lang.String predecessor,
                               java.lang.String successor)

Return the number of times the predecessor is directly followed by the successor

Parameters:

predecessor - Predecessor

successor - Successor

Returns:

the number of times the predecessor is directly followed by the successor

countStart

protected void countStart(java.lang.String[] activity,
                          java.lang.Long n)

Count a new occurrence of the activity being the first one in a trace

Parameters:

activity - Start activity (Compose name)

n - Number of occurrences

countStart

protected void countStart(java.lang.String activity,
                          java.lang.Long n)

Count a new occurrence of the activity being the first one in a trace

Parameters:

activity - Start activity

n - Number of occurrences

countEnd

protected void countEnd(java.lang.String[] activity,
                        java.lang.Long n)

Count a new occurrence of the activity being the last one in a trace

Parameters:

activity - End activity (Compose name)

n - Number of occurrences

countEnd

protected void countEnd(java.lang.String activity,
                        java.lang.Long n)

Count a new occurrence of the activity being the last one in a trace

Parameters:

activity - End activity

n - Number of occurrences

countEdge

protected void countEdge(java.lang.String[] predecessor,
                         java.lang.String[] successor,
                         java.lang.Long n)

Count a new occurrence of the directly follows edge between the two activities

Parameters:

predecessor - Predecessor activity (Compose name)

successor - Successor activity (Compose name)

n - Number of occurrences

countEdge

protected void countEdge(java.lang.String predecessor,
                         java.lang.String successor,
                         java.lang.Long n)

Count a new occurrence of the directly follows edge between the two activities

Parameters:

predecessor - Predecessor activity

successor - Successor activity

n - Number of occurrences

read

public boolean read(java.lang.String filename)

Read a graph from an input file

Parameters:

filename - Input filename with the graph

Returns:

True if the graph has been read correctly

write

public void write(java.lang.String output_filename)

Write the graph in the specified file

Parameters:

output_filename - Output file

write

public void write()

Write the graph in the standard output

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object