Package | Description |
---|---|
ccs | |
ccs.graph |
Modifier and Type | Method and Description |
---|---|
Graph |
MotionModel.getEndRealization() |
Graph |
ConfigPanel.getGraph() |
Graph |
TreeDecompModel.getGraph() |
Graph |
TreeDecompModel.getGraphClone() |
Graph |
MotionModel.getNearestG1() |
Graph |
MotionModel.getNearestG2() |
Graph |
MotionModel.getStartRealization() |
Graph |
TreeDecompModel.tryRealize(java.lang.Double val,
SolutionType forward) |
Graph |
TreeDecompModel.tryRealize(SolutionType t) |
Modifier and Type | Method and Description |
---|---|
ContinuousMotionSamples<Graph> |
MotionModel.getMotionSamples() |
ContinuousMotionSamples<Graph> |
MotionModel.getMotionSamples1() |
ContinuousMotionSamples<Graph> |
MotionModel.getMotionSamples2() |
ccs.PercentageListModel<SamplePoint<Graph>> |
MotionModel.getSpinnerModel() |
ccs.PercentageListModel<SamplePoint<Graph>> |
MotionModel.getSpinnerModel1() |
ccs.PercentageListModel<SamplePoint<Graph>> |
MotionModel.getSpinnerModel2() |
java.util.ArrayList<Graph> |
TreeDecompModel.tryRealize(java.lang.Double val) |
Modifier and Type | Method and Description |
---|---|
ContinuousMotion |
TreeDecompModel.findPath(Graph startRealization,
Graph endRealization) |
ConnectedComponent |
TreeDecompModel.genComponent(Graph g) |
SolutionType |
TreeDecompModel.getForwardSolutionType(Graph g) |
void |
MotionModel.setEndRealization(Graph endRealization) |
boolean |
Curve3DMotion.setFocalPoint(Graph g) |
boolean |
Curve3D.setFocalPoint(Graph g)
Emphasize a point on the curve.
|
void |
TreeDecompModel.setPoints(Graph g) |
void |
MotionModel.setStartRealization(Graph startRealization) |
Constructor and Description |
---|
BoundingBox(Graph g) |
ConfigPanel(Main m,
Graph g) |
ConfigPanel(Main m,
Graph g,
double ratio,
boolean isThumb) |
Modifier and Type | Field and Description |
---|---|
Graph |
TreeDecomp.graph |
Modifier and Type | Method and Description |
---|---|
Graph |
Graph.clone() |
static Graph |
Util.generateHennebergGraph(int n,
boolean isTriangleFree) |
static Graph |
Util.generateListGraph(int n) |
Graph |
Graph.inducedSubgaph(java.util.ArrayList<Vertex> vset) |
static Graph |
Graph.readFromStream(java.io.ObjectInputStream in) |
Graph |
TreeDecomp.solve(double length,
SolutionType forward)
Given an lf, solve for realization with a specific solution type
|
Graph |
TreeDecomp.tryRealize(double length,
SolutionType forward) |
Graph |
TreeDecomp.tryRealize(SolutionType t) |
Modifier and Type | Method and Description |
---|---|
java.util.AbstractList<SamplePoint<Graph>> |
ComponentRealizationsSampler.sample(ccs.graph.Node n) |
java.util.ArrayList<Graph> |
TreeDecomp.solve(double length) |
java.util.ArrayList<Graph> |
TreeDecomp.solve(ccs.graph.EdgePos newBasePos)
Given lf, solve the possible realizations w/ any solution type.
|
java.util.ArrayList<Graph> |
TreeDecomp.tryRealize(double length) |
Modifier and Type | Method and Description |
---|---|
double |
TreeDecomp.completeDistance(Graph g1,
Graph g2)
Treat the length of canonical base non-edges as a vector, and compute the
vector distance between g1 and g2
|
static ConnectedComponent |
ConnectedComponent.findComponentOf(TreeDecomp t,
Graph g1) |
MotionPath |
TreeDecomp.findPath(Graph g1,
Graph g2) |
static MotionPath |
MotionPath.findPath(TreeDecomp t,
Graph g1,
Graph g2) |
ConnectedComponent |
TreeDecomp.findPathFrom(Graph g1) |
static java.util.LinkedList<Cluster> |
Util.getDecompose(Graph g) |
SolutionType |
TreeDecomp.getForwardSolutionType(Graph g) |
SolutionType |
TreeDecomp.getForwardSolutionType(Graph g,
int numOfSteps) |
void |
Graph.setPoints(Graph g) |
Constructor and Description |
---|
Cluster(Graph g) |
TreeDecomp(Graph g) |