org.ginsim.service.tool.graphcomparator

Class GraphComparator<V,E extends Edge<V>,G extends Graph<V,E>>

java.lang.Object

java.lang.Thread

org.colomoto.common.task.AbstractTask<GraphComparatorResult<V,E,G>>

org.ginsim.service.tool.graphcomparator.GraphComparator<V,E,G>

All Implemented Interfaces:

Runnable, Callable<GraphComparatorResult<V,E,G>>, org.colomoto.common.task.Task<GraphComparatorResult<V,E,G>>

Direct Known Subclasses:

DynamicGraphComparator, RegulatoryGraphComparator

public abstract class GraphComparator<V,E extends Edge<V>,G extends Graph<V,E>>
extends org.colomoto.common.task.AbstractTask<GraphComparatorResult<V,E,G>>

Compare two Graphs. Create a new graph with all components from the two compared graphs and track components which are specific to one of them, or changes between common components. This abstract class provides the common mechanism, extensions support specific graph types.

Since:

January 2009

Author:

Duncan Berenguier, Aurelien Naldi

Nested Class Summary

Nested classes/interfaces inherited from class java.lang.Thread

Thread.State, Thread.UncaughtExceptionHandler

Field Summary

Fields

Modifier and Type	Field and Description
G	graph_1
G	graph_2
G	graph_new
protected GraphComparatorResult<V,E,G>	result

Fields inherited from class org.colomoto.common.task.AbstractTask

canceled

Fields inherited from class java.lang.Thread

MAX_PRIORITY, MIN_PRIORITY, NORM_PRIORITY

Constructor Summary

Constructors

Modifier	Constructor and Description
protected	GraphComparator(G g1, G g2, G g_new)

Method Summary

Modifier and Type	Method and Description
protected abstract E	copyEdge(G srcGraph, E edge)
protected abstract V	copyNode(G srcGraph, V node)
protected abstract void	doSpecialisedComparison()
G	getDiffGraph() Return a merge graph colored to indicates vertices and edges parent graph.
G	getG1() Return the first graph to compare
G	getG2() Return the second graph to compare
void	log(boolean b) append the boolean b to the log
void	log(int i) append the int i to the log
void	log(long l) append the long l to the log
void	log(Object o) append the object o to the log
void	log(String s) append the string 's' to the log
protected GraphComparatorResult<V,E,G>	performTask() Build the basic topology for the diff graph (node+edges) by calling others functions 1) addNodesFromGraph on both graphs 2) setNodesColor 3) addEdgesFromGraph on each node on both graphs

Methods inherited from class org.colomoto.common.task.AbstractTask

background, call, cancel, getResult, getStatus, run

Methods inherited from class java.lang.Thread

activeCount, checkAccess, clone, countStackFrames, currentThread, destroy, dumpStack, enumerate, getAllStackTraces, getContextClassLoader, getDefaultUncaughtExceptionHandler, getId, getName, getPriority, getStackTrace, getState, getThreadGroup, getUncaughtExceptionHandler, holdsLock, interrupt, interrupted, isAlive, isDaemon, isInterrupted, join, join, join, resume, setContextClassLoader, setDaemon, setDefaultUncaughtExceptionHandler, setName, setPriority, setUncaughtExceptionHandler, sleep, sleep, start, stop, stop, suspend, toString, yield

Methods inherited from class java.lang.Object

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

Methods inherited from interface org.colomoto.common.task.Task

setParameter, setParameters, setParameters

Field Detail

graph_new

public final G extends Graph<V,E> graph_new

graph_1

public final G extends Graph<V,E> graph_1

graph_2

public final G extends Graph<V,E> graph_2

result

protected GraphComparatorResult<V,E extends Edge<V>,G extends Graph<V,E>> result

Constructor Detail

GraphComparator

protected GraphComparator(G g1,
                          G g2,
                          G g_new)

Method Detail

performTask

protected GraphComparatorResult<V,E,G> performTask()
                                            throws Exception

Build the basic topology for the diff graph (node+edges) by calling others functions 1) addNodesFromGraph on both graphs 2) setNodesColor 3) addEdgesFromGraph on each node on both graphs

Specified by:

performTask in class org.colomoto.common.task.AbstractTask<GraphComparatorResult<V,E extends Edge<V>,G extends Graph<V,E>>>

Throws:

Exception

copyNode

protected abstract V copyNode(G srcGraph,
                              V node)

copyEdge

protected abstract E copyEdge(G srcGraph,
                              E edge)

doSpecialisedComparison

protected abstract void doSpecialisedComparison()

getDiffGraph

public G getDiffGraph()

Return a merge graph colored to indicates vertices and edges parent graph.

Returns:

the diff graph

getG1

public G getG1()

Return the first graph to compare

Returns:

the graph

getG2

public G getG2()

Return the second graph to compare

Returns:

the graph

log

public void log(String s)

append the string 's' to the log

Parameters:

s -

log

public void log(long l)

append the long l to the log

Parameters:

l -

log

public void log(int i)

append the int i to the log

Parameters:

i -

log

public void log(boolean b)

append the boolean b to the log

Parameters:

b -

log

public void log(Object o)

append the object o to the log

Parameters:

o -