Package tools.refinery.interpreter.rete.itc.alg.representative

Class RepresentativeElectionAlgorithm<T>

java.lang.Object

tools.refinery.interpreter.rete.itc.alg.representative.RepresentativeElectionAlgorithm<T>

All Implemented Interfaces:

IGraphObserver<T>

Direct Known Subclasses:

StronglyConnectedComponentAlgorithm, WeaklyConnectedComponentAlgorithm

public abstract class RepresentativeElectionAlgorithm<T>
extends Object
implements IGraphObserver<T>

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static interface	RepresentativeElectionAlgorithm.Factory

Field Summary

Fields

Modifier and Type	Field	Description
protected final Map<T,Set<T>>	components
protected final Graph<T>	graph
protected final Map<T,T>	representatives

Constructor Summary

Constructors

Modifier	Constructor	Description
protected	RepresentativeElectionAlgorithm(Graph<T> graph)

Method Summary

Modifier and Type	Method	Description
protected void	assignNewRepresentative(T oldRepresentative, Set<T> set)
void	dispose()
Set<T>	getComponent(T representative)
Map<T,Set<T>>	getComponents()
T	getRepresentative(T node)
protected abstract void	initializeComponents()
protected void	initializeSet(Set<T> set)
protected void	merge(Set<T> toMerge)
protected void	merge(T leftRepresentative, T rightRepresentative)
void	nodeDeleted(T n)	Used to notify when a node is deleted from the graph.
void	nodeInserted(T n)	Used to notify when a node is inserted into the graph.
protected void	notifyToObservers(T node, T oldRepresentative, T newRepresentative)
protected void	notifyToObservers(T node, T representative, Direction direction)
void	setObserver(RepresentativeObserver<? super T> observer)

Methods inherited from class java.lang.Object

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

Methods inherited from interface tools.refinery.interpreter.rete.itc.igraph.IGraphObserver

edgeDeleted, edgeInserted

Field Details

graph

protected final Graph<T> graph

representatives

protected final Map<T,T> representatives

components

protected final Map<T,Set<T>> components

Constructor Details

RepresentativeElectionAlgorithm

protected RepresentativeElectionAlgorithm(Graph<T> graph)

Method Details

initializeComponents

protected abstract void initializeComponents()

initializeSet

protected void initializeSet(Set<T> set)

merge

protected void merge(Set<T> toMerge)

merge

protected void merge(T leftRepresentative,
 T rightRepresentative)

assignNewRepresentative

protected void assignNewRepresentative(T oldRepresentative,
 Set<T> set)

setObserver

public void setObserver(RepresentativeObserver<? super T> observer)

getComponents

public Map<T,Set<T>> getComponents()

getRepresentative

public T getRepresentative(T node)

getComponent

public Set<T> getComponent(T representative)

dispose

public void dispose()

nodeInserted

public void nodeInserted(T n)

Description copied from interface: IGraphObserver

Used to notify when a node is inserted into the graph.

Specified by:

nodeInserted in interface IGraphObserver<T>

Parameters:

n - the node

nodeDeleted

public void nodeDeleted(T n)

Description copied from interface: IGraphObserver

Used to notify when a node is deleted from the graph.

Specified by:

nodeDeleted in interface IGraphObserver<T>

Parameters:

n - the node

notifyToObservers

protected void notifyToObservers(T node,
 T oldRepresentative,
 T newRepresentative)

notifyToObservers

protected void notifyToObservers(T node,
 T representative,
 Direction direction)