Package etomica.graph.operations

Class ReeHoover

java.lang.Object

etomica.graph.operations.ReeHoover

All Implemented Interfaces:

Unary

public class ReeHoover
extends java.lang.Object
implements Unary

This operation performs conversion from a set of biconnected graphs with f edges to a set of diagrams of fully connected diagrams with e and f edges. The operation is performed using the procedure as described in F. H. Ree and W. G. Hoover, J. Chem. Phys. 41, 1635 (1964). This procedure only works for the full set of biconnected graphs of a given order (or multiple orders), each with only f edges and a coefficient proportional to the number of ways to permute the nodes that yield a different (although equivalent) graph.

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static class	ReeHoover.ReeHooverParameters

Field Summary

Fields

Modifier and Type	Field	Description
protected IsBiconnected	isBi

Constructor Summary

Constructors

Constructor	Description
ReeHoover()

Method Summary

Modifier and Type	Method	Description
java.util.Set<Graph>	apply(java.util.Set<Graph> argument, Parameters params)
int	calcReeHooverCoefficient(Graph g, int numAlreadyRemoved, byte edgeStart)

Methods inherited from class java.lang.Object

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

Field Detail

isBi

protected final IsBiconnected isBi

Constructor Detail

ReeHoover

public ReeHoover()

Method Detail

apply

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

Specified by:

apply in interface Unary

calcReeHooverCoefficient

public int calcReeHooverCoefficient(Graph g,
                                    int numAlreadyRemoved,
                                    byte edgeStart)