public class VirialDiagramsMix2
extends java.lang.Object
Modifier and Type | Class | Description |
---|---|---|
static class |
VirialDiagramsMix2.MaxIsomorphCriteriaMixture |
Modifier and Type | Field | Description |
---|---|---|
protected boolean |
allPermutations |
|
protected java.util.Map<Graph,Graph> |
cancelMap |
|
protected java.util.Set<Graph> |
cancelP |
|
protected java.util.Set<Graph> |
disconnectedP |
|
protected boolean |
doDisconnectedMatching |
|
protected boolean |
doKeepEBonds |
|
protected boolean |
doReeHoover |
|
protected boolean |
doShortcut |
|
char |
eBond |
|
char |
efbcBond |
|
char |
excBond |
|
char |
fBond |
|
protected boolean[] |
flex |
|
protected char[] |
flexColors |
|
protected boolean |
isInteractive |
|
protected java.util.Set<Graph> |
lnfXi |
|
protected int |
n |
|
protected char[] |
nodeColors |
|
protected java.util.Set<Graph> |
p |
|
protected java.util.Set<Graph> |
rhoA |
|
protected java.util.Set<Graph> |
rhoB |
Constructor | Description |
---|---|
VirialDiagramsMix2(int n,
boolean[] flex) |
|
VirialDiagramsMix2(int n,
boolean[] flex,
boolean interactive) |
Modifier and Type | Method | Description |
---|---|---|
java.util.Map<Graph,Graph> |
getCancelMap() |
|
java.util.Set<Graph> |
getExtraDisconnectedVirialGraphs(int[] numPoints) |
|
java.util.Set<Graph> |
getMSMCGraphs(boolean connectedOnly,
int flexID,
int[] numPoints) |
|
java.util.Set<Graph> |
getSplitDisconnectedVirialGraphs(Graph g) |
|
static boolean |
graphHasEdgeColor(Graph g,
char color) |
|
static void |
main(java.lang.String[] args) |
|
GraphList |
makeGraphList() |
|
void |
makeRhoDiagrams() |
|
ClusterSumShell[] |
makeSingleVirialClusters(ClusterSum coreCluster,
MayerFunction[][] f,
int flexID,
int[] numPoints) |
|
ClusterSum |
makeVirialCluster(MayerFunction[][] f,
int flexID,
int[] numPoints) |
|
ClusterSum |
makeVirialCluster(java.util.Set<Graph> graphs,
MayerFunction[][] f,
int flexID,
int[] numPoints) |
|
void |
makeVirialDiagrams() |
|
int |
populateEFBonds(Graph g,
java.util.List<ClusterBonds> allBonds,
java.util.List<java.lang.Double> weights,
int firstPoint,
int lastPoint,
boolean swapControl,
boolean connectedGraph,
int flexID) |
|
void |
setDoDisconnectedMatching(boolean newDoDisconnectedMatching) |
|
void |
setDoKeepEBonds(boolean newDoKeepEBonds) |
|
void |
setDoReeHoover(boolean newDoReeHoover) |
|
void |
setDoShortcut(boolean newDoShortcut) |
|
protected byte |
swap0n(byte i,
int firstPoint,
int lastPoint,
boolean connectedGraph) |
protected final int n
protected char[] nodeColors
protected final boolean[] flex
protected char[] flexColors
protected final boolean isInteractive
protected boolean doReeHoover
protected java.util.Set<Graph> p
protected java.util.Set<Graph> cancelP
protected java.util.Set<Graph> disconnectedP
protected java.util.Set<Graph> rhoA
protected java.util.Set<Graph> rhoB
protected java.util.Set<Graph> lnfXi
protected boolean doShortcut
protected boolean doKeepEBonds
protected boolean doDisconnectedMatching
public char fBond
public char eBond
public char excBond
public char efbcBond
protected boolean allPermutations
public VirialDiagramsMix2(int n, boolean[] flex)
public VirialDiagramsMix2(int n, boolean[] flex, boolean interactive)
public static void main(java.lang.String[] args)
public void setDoReeHoover(boolean newDoReeHoover)
public void setDoShortcut(boolean newDoShortcut)
public void setDoKeepEBonds(boolean newDoKeepEBonds)
public void setDoDisconnectedMatching(boolean newDoDisconnectedMatching)
public java.util.Set<Graph> getExtraDisconnectedVirialGraphs(int[] numPoints)
public java.util.Set<Graph> getSplitDisconnectedVirialGraphs(Graph g)
public GraphList makeGraphList()
public static boolean graphHasEdgeColor(Graph g, char color)
public void makeRhoDiagrams()
public void makeVirialDiagrams()
public java.util.Set<Graph> getMSMCGraphs(boolean connectedOnly, int flexID, int[] numPoints)
public ClusterSum makeVirialCluster(MayerFunction[][] f, int flexID, int[] numPoints)
public ClusterSum makeVirialCluster(java.util.Set<Graph> graphs, MayerFunction[][] f, int flexID, int[] numPoints)
protected byte swap0n(byte i, int firstPoint, int lastPoint, boolean connectedGraph)
public int populateEFBonds(Graph g, java.util.List<ClusterBonds> allBonds, java.util.List<java.lang.Double> weights, int firstPoint, int lastPoint, boolean swapControl, boolean connectedGraph, int flexID)
public ClusterSumShell[] makeSingleVirialClusters(ClusterSum coreCluster, MayerFunction[][] f, int flexID, int[] numPoints)