Package etomica.graph.operations

Class Unfactor

java.lang.Object

etomica.graph.operations.Unfactor

All Implemented Interfaces:

Unary

public class Unfactor
extends java.lang.Object
implements Unary

This operation will do the reverse of the Factor operation. Given a graph with root points that is disconnected, it will return a graph that has these root points superimposed with other points, such that the graph is connected if possible. This is done by first splitting the graph into components and then multiplying them together.

Field Summary

Fields

Modifier and Type	Field	Description
protected SplitGraph	graphSplitter
protected MulFlexible	mulFlex

Constructor Summary

Constructors

Constructor	Description
Unfactor()

Method Summary

Modifier and Type	Method	Description
java.util.Set<Graph>	apply(Graph g, MulFlexible.MulFlexibleParameters params)
java.util.Set<Graph>	apply(java.util.Set<Graph> argument, Parameters params)

Methods inherited from class java.lang.Object

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

Field Detail

graphSplitter

protected final SplitGraph graphSplitter

mulFlex

protected final MulFlexible mulFlex

Constructor Detail

Unfactor

public Unfactor()

Method Detail

apply

public java.util.Set<Graph> apply(java.util.Set<Graph> argument,
                                  Parameters params)

Specified by:

apply in interface Unary

apply

public java.util.Set<Graph> apply(Graph g,
                                  MulFlexible.MulFlexibleParameters params)