|
|||||||||
| Home >> All >> com >> port80 >> graph >> dot >> [ impl overview ] | PREV NEXT | ||||||||
Uses of Class
com.port80.graph.dot.impl.VirtualVertex
| Uses of VirtualVertex in com.port80.graph.dot.impl |
| Fields in com.port80.graph.dot.impl declared as VirtualVertex | |
(package private) VirtualVertex |
GridFactory.fSrc
|
(package private) VirtualVertex |
GridFactory.fDest
|
(package private) VirtualVertex[] |
GridFactory.GridIterator.fVts
|
(package private) VirtualVertex |
ErasedPath.src
|
(package private) VirtualVertex |
ErasedPath.dest
|
(package private) VirtualVertex |
Grid.vertex
|
(package private) VirtualVertex |
Grid.leftVertex
|
(package private) VirtualVertex |
VirtualVertex.inBus
Adjacent flatindex list. |
(package private) VirtualVertex |
VirtualVertex.outBus
|
private VirtualVertex[] |
VirtualGraph.vertices
|
(package private) VirtualVertex[] |
VirtualGraph.Rank.vts
number of nodes in this rank |
(package private) VirtualVertex |
VirtualGraph.MinimiumSpacingIterator.left
|
(package private) VirtualVertex |
VirtualGraph.MinimiumSpacingIterator.right
|
protected VirtualVertex |
VirtualEdge.head
|
protected VirtualVertex |
VirtualEdge.tail
|
(package private) VirtualVertex |
Untangle.Cell.vertex
The vertex at this cell. |
VirtualVertex |
VirtualChain.fTail
|
VirtualVertex |
VirtualChain.fHead
|
(package private) VirtualVertex |
Cell.vertex
The vertex at this cell. |
| Methods in com.port80.graph.dot.impl that return VirtualVertex | |
(package private) VirtualVertex |
ErasedPath.get(int i)
|
static VirtualVertex |
VirtualVertex.newBusVertex(com.port80.graph.IVertex v,
int rank,
VirtualGraph parent)
Represent a connection on the buses. |
static VirtualVertex |
VirtualVertex.newAuxVertex(java.lang.String name,
int rank,
VirtualGraph parent)
Represent a connection from IVertex to its in/out bus replicates. |
VirtualVertex |
VirtualGraph.getVertex(java.lang.String name)
|
VirtualVertex[] |
VirtualGraph.getVertices()
|
VirtualVertex |
VirtualEdge.getHead()
|
VirtualVertex |
VirtualEdge.getTail()
|
VirtualVertex |
VirtualEdge.getOpposite(VirtualVertex v)
|
VirtualVertex |
VirtualEdge.getChainHead()
|
VirtualVertex |
VirtualEdge.getChainTail()
|
(package private) VirtualVertex |
Untangle.Cell.getVertex()
|
private VirtualVertex |
Route.neighbour(VirtualVertex v,
VirtualEdge ie,
VirtualEdge oe,
int lly,
int ury,
int dir)
Get neighbour on left (dir=-1) or right (dir=1). |
private VirtualVertex |
VirtualChain.initLength()
Calculate chain length base on current coordinates. |
(package private) VirtualVertex |
Cell.getVertex()
|
| Methods in com.port80.graph.dot.impl with parameters of type VirtualVertex | |
private void |
Anneal_Test01.printCrossCost(VirtualVertex v)
|
int |
GridFactory.leftBorder(VirtualVertex v)
|
int |
GridFactory.rightBorder(VirtualVertex v)
|
void |
GridFactory.initGrid(VirtualVertex src,
VirtualVertex dest)
Find all the grid points given the source and destination vertex. |
void |
GridFactory.updateSpaceTable(VirtualVertex v)
Update space table values for the given vertex in case vertex.x is changed. |
(package private) void |
GridFactory.moveVertex(VirtualVertex v,
int from,
int to)
Adjust SpaceTable orders when vertex has moved from index 'from' to 'to'. |
Grid |
GridFactory.get(VirtualVertex v)
Get an initialized vertex Grid. |
private Cell |
AnnealWithCell.newVertexCells(Cell[] row,
int rn,
int left,
int right,
VirtualVertex v)
Populate cells [left..right) occupied by v. |
static float |
Grid.travelCostTo(VirtualVertex child,
VirtualVertex parent,
VirtualVertex grandparent)
Travel cost to 'child' from 'parent' and 'grandparent'. |
static Grid |
Grid.newVertexGrid(VirtualVertex v)
|
boolean |
Grid.reached(VirtualVertex dest)
|
int |
Grid.accept(Grid parent,
VirtualVertex dest,
float cost)
Check if visit from parent would result in a better path. |
void |
Grid.setVertex(VirtualVertex v)
|
void |
Grid.setLeftVertex(VirtualVertex v)
|
float |
Grid.estimate(VirtualVertex dest)
Optimistic estimate cost from this Grid to the given destination. |
VirtualEdge |
VirtualVertex.findOutChain(VirtualVertex head)
Find edge chain that terminate with the given head and has no label. |
private void |
VirtualGraph.buildVertex(VirtualVertex v)
Install a node at the current right end of its rank |
private void |
VirtualGraph.queueNeighbours(VirtualVertex v,
java.util.Set visited,
java.util.List queue,
int pass)
Queue decendents/ancestors from v. |
private void |
VirtualGraph.createEdgeChain(VirtualVertex tail,
com.port80.graph.IEdge e)
Create an VirtualEdge chain for the given IEdge. |
private void |
VirtualGraph.createStubChain(VirtualVertex tail,
VirtualVertex head)
Create an edge chain for connections between a vertex and its inBus and outBus. |
private void |
VirtualGraph.createAuxChain(VirtualVertex tail,
VirtualVertex head,
java.lang.String name)
Create an edge chain for connections between a vertex and its inBus and outBus duplicates. |
private int |
VirtualGraph.localCost(VirtualVertex v,
boolean tobottom)
Determine crossing cost if vertex has port. |
private void |
VirtualGraph.breakFlatCycles(VirtualVertex v,
java.util.Set visited,
java.util.Set ancestors,
VirtualGraph.AdjacencyMatrix matrix)
Look for cycles starting from given vertex 'v'. |
private void |
VirtualGraph.initFlatOrder(VirtualVertex v,
java.util.Set visited,
java.util.List ret)
Construct reachable vertex from 'v' in post-order. |
void |
VirtualGraph.Rank.insert(int index,
VirtualVertex v)
Insert 'v' before index position 'i'. |
boolean |
VirtualGraph.Rank.keepOrder(VirtualVertex v,
VirtualVertex w)
|
(package private) static VirtualEdge |
VirtualEdge.newEdge(VirtualVertex head,
VirtualVertex tail,
com.port80.graph.IEdge e,
VirtualEdge ve,
VirtualGraph parent)
|
(package private) static VirtualEdge |
VirtualEdge.newSelfEdge(VirtualVertex head,
com.port80.graph.IEdge e,
VirtualEdge ve,
VirtualGraph parent)
|
(package private) static VirtualEdge |
VirtualEdge.newBusEdge(VirtualVertex head,
VirtualVertex tail,
com.port80.graph.IEdge e,
VirtualEdge ve,
VirtualGraph parent)
|
(package private) static VirtualEdge |
VirtualEdge.newStubEdge(VirtualVertex head,
VirtualVertex tail,
VirtualEdge ve,
VirtualGraph parent)
|
(package private) static VirtualEdge |
VirtualEdge.newFlatEdge(VirtualVertex head,
VirtualVertex tail,
com.port80.graph.IEdge e,
VirtualGraph parent)
|
(package private) static VirtualEdge |
VirtualEdge.newAuxEdge(VirtualVertex head,
VirtualVertex tail,
VirtualEdge ve,
VirtualGraph parent)
Auxillary edges connect Vertex to its in/out bus vertices and used (by MinCross) to pull bus vertices together. |
VirtualVertex |
VirtualEdge.getOpposite(VirtualVertex v)
|
int |
Untangle.eraseTrail(VirtualEdge chainhead,
VirtualVertex src,
VirtualEdge[] retchain,
Untangle.CellList erased)
Erase route for edge chain started at 'e'. |
(package private) void |
Untangle.Cell.setVertex(VirtualVertex v)
Set a cell to vertex 'v'. |
private void |
Route.adjustVertexWithReorder(int neworder,
int newx,
VirtualVertex head,
VirtualGraph.Rank rank)
Move given vertex to location before the vertex vts[neworder] and adjust x coordinate to as close as possible to 'newx'. |
private void |
Route.adjustVertexWithoutReorder(int newx,
VirtualVertex head,
VirtualGraph.Rank rank)
Adjust x coordinate of given vertex to as close as possible to newx while maintaining vertex orders. |
private int |
Route.maximalBoxes(int side,
VirtualVertex v,
VirtualEdge ie,
VirtualEdge oe,
DotBoxList ret)
Determine the maximal bounding box around 'v' available for routing edges 'ie' and 'oe'. |
private VirtualVertex |
Route.neighbour(VirtualVertex v,
VirtualEdge ie,
VirtualEdge oe,
int lly,
int ury,
int dir)
Get neighbour on left (dir=-1) or right (dir=1). |
private boolean |
Route.pathsCrossed(VirtualVertex v0,
VirtualVertex v1,
VirtualEdge ie1,
VirtualEdge oe1)
Check if edge chain 'ie1->v1->oe1' any cross edge chain through 'v0'. |
private boolean |
Route.isSplineMidPoint(VirtualVertex v)
|
private void |
Route.clipShape(VirtualVertex v,
java.awt.Shape shape,
DotSpline spline,
int index,
boolean istail)
Clip spline by vertex shape, given 'index' is the tail (left) end of the Bezier that intersect the shape. |
private DotVertex |
Position.createDotVertex(VirtualVertex v)
|
private boolean |
MinCross.flatMedian(VirtualVertex v)
When given vertex 'v' do not have vertically connections, try determine its median value from one of its peer 'w' that do. |
private int |
MinCross.inCost(VirtualVertex v,
VirtualVertex w,
boolean swap,
boolean reverse)
For each input to v crossed input to w, cost+=product of xpenalty of the crossed edges. |
private int |
MinCross.outCost(VirtualVertex v,
VirtualVertex w,
boolean swap,
boolean reverse)
Crossing cost between v and w if v is on left of w. |
private double |
DotPath.averageSlope(VirtualVertex v)
Find the average slope of all in and out edges at 'v'. |
(package private) static Cell |
Cell.newVertexCell(int rn,
int cn,
VirtualVertex v)
|
(package private) static Cell |
Cell.newBlockedCell(int rn,
int cn,
VirtualVertex v)
|
(package private) void |
Cell.setVertex(VirtualVertex v,
Cell[][] map)
Set a cell to vertex 'v' and change cells within its width to be BLOCKED. |
(package private) int |
Anneal.crossAfter(Grid parent,
Grid child,
VirtualVertex beforeParent,
VirtualVertex beforeChild,
VirtualEdge segment)
Calculate crossing cost for edge from parent to child below. |
private int |
Anneal.crossAfterBefore(Grid parent,
Grid child,
VirtualVertex beforeParent,
VirtualEdge segment)
Calculate crossing cost for edge from parent to space before the first vertex below. |
private int |
Anneal.crossBeforeAfter(Grid parent,
Grid child,
VirtualVertex beforeChild,
VirtualEdge segment)
parent vts[0](afterParent) |-------------------v beforechild child |
private void |
Anneal.expandDown(Grid best,
VirtualVertex dest,
float oldcost,
ErasedPath erased)
Expand from best to its children below. |
private void |
Anneal.expandUp(Grid best,
VirtualVertex dest,
float oldcost,
ErasedPath erased)
Expand from best to its children above. |
| Constructors in com.port80.graph.dot.impl with parameters of type VirtualVertex | |
Grid(VirtualVertex v)
|
|
VirtualEdge(int type,
VirtualVertex head,
VirtualVertex tail,
com.port80.graph.IEdge e,
VirtualEdge ve,
VirtualGraph parent)
Create a virtual edge as part of an edge chain. |
|
Untangle.Cell(int type,
int rn,
int cn,
VirtualVertex v)
|
|
Untangle.Cell(int rn,
int cn,
VirtualVertex v)
|
|
Cell(int type,
int rn,
int cn,
VirtualVertex v)
|
|
|
|||||||||
| Home >> All >> com >> port80 >> graph >> dot >> [ impl overview ] | PREV NEXT | ||||||||