Package | Description |
---|---|
ccs.graph |
Modifier and Type | Method and Description |
---|---|
EdgePos |
Graph.getPoints(Edge e) |
EdgePos |
Graph.getPoints(Vertex v1,
Vertex v2) |
Modifier and Type | Method and Description |
---|---|
double |
EdgePos.angle(EdgePos that) |
java.util.HashMap<Vertex,Point2D> |
Cluster.getTransform(Edge e,
EdgePos newPos) |
java.util.ArrayList<Graph> |
TreeDecomp.solve(EdgePos newBasePos)
Given lf, solve the possible realizations w/ any solution type.
|
private Graph |
TreeDecomp.solve(EdgePos newBasePos,
SolutionType forward) |
void |
Graph.transformVertices(java.util.Collection<Vertex> list,
Cluster c,
Edge e,
EdgePos newPos) |