|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objecthelix.graph.algo.c3part.aggregator.NodeAggregator
public abstract class NodeAggregator
A class to define the way datagraph nodes are aggregated in
a multinode.
The main method is getTerminals(V, color)
that returns the
set of datagraph terminals nodes {vi} of given color that can be aggregated
to a given multigraph vertex V. This is achieved by calling the isAggregable
method (that tells if a datagraph node 'v' can be aggregated to a multigraph
vertex 'V') on a proper set of candidates nodes.
To subclass, you have to implement two methods:
The isAggregable(V, v)
public method tells if datanode v can be
aggregated to multinode V
The getCandidates(V)
protected method returns an Iterable of
datanodes that are candidates to be terminals
The definition of terminals is therefore:
terminals = {v in getCandidates(V) / isAggregable(V, v)}
Typical subclasses are cliqueAggregator, centeredAggregator
Constructor Summary | |
---|---|
NodeAggregator(Graph datagraph,
C3PartOptions options)
required constructor |
Method Summary | |
---|---|
GraphCleaner |
getCleanerFor()
get an instance of a datagraph cleaner for this aggregator default: return a NoCleaner |
C3PartOptions |
getOptions()
accessor to current options |
String |
getParamInfo()
get optional parameters info this is used only for logging purpose (for user information) so default is to return an empty string |
int |
getPreferredColor()
tells if this aggregator has some preferred color (e.g. |
GSet<Vertex> |
getTerminals(Vertex V,
int color)
returns the set of datagraph terminals nodes {v} of given color that can be aggregated to a given multigraph vertex V = (v1,..., vk). |
abstract boolean |
isAggregable(Vertex V,
Vertex v)
Check if datagraph node 'v' can be aggregated to multigraph vertex V. |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public NodeAggregator(Graph datagraph, C3PartOptions options)
Method Detail |
---|
public abstract boolean isAggregable(Vertex V, Vertex v)
public GSet<Vertex> getTerminals(Vertex V, int color)
isAggregable
on a set of candidates nodes returned by the getCandidates_
internal method :
v is terminal <=> v is candidate and isAggregable(V, v)
public C3PartOptions getOptions()
public int getPreferredColor()
public GraphCleaner getCleanerFor()
public String getParamInfo()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |