|
|||||||||
| Home >> All >> com >> port80 >> graph >> dot >> [ impl overview ] | PREV NEXT | ||||||||
Uses of Class
com.port80.graph.dot.impl.VirtualGraph
| Uses of VirtualGraph in com.port80.graph.dot.impl |
| Fields in com.port80.graph.dot.impl declared as VirtualGraph | |
private VirtualGraph |
Anneal_TestBenchmark01.fVGraph
|
(package private) VirtualGraph |
Anneal_Test01.fVGraph
|
(package private) VirtualGraph |
GridFactory_Test01.fVGraph
|
private VirtualGraph |
Anneal_Test02.fVGraph
|
(package private) VirtualGraph |
GridFactory.fGraph
|
(package private) VirtualGraph |
ErasedPath.fGraph
|
(package private) VirtualGraph |
AnnealWithCell.fGraph
|
(package private) VirtualGraph |
VirtualVertex.parent
The original IVertex/IEdge. |
(package private) VirtualGraph |
Untangle.graph
|
private VirtualGraph |
Route.fGraph
|
(package private) VirtualGraph |
Anneal.fGraph
|
| Methods in com.port80.graph.dot.impl with parameters of type VirtualGraph | |
void |
Anneal_TestBenchmark01.benchmarkRankCost(Anneal anneal,
VirtualGraph vgraph)
Simple benchmark of the rank cost methods. |
void |
Anneal_TestBenchmark01.benchmarkGridIterator(VirtualGraph vgraph)
|
void |
Anneal_Test02.checkRouteBus(Anneal anneal,
VirtualGraph vgraph)
|
void |
Anneal_Test02.checkRoutePTP(Anneal anneal,
VirtualGraph vgraph)
|
void |
Anneal_Test02.checkMoveVertex(Anneal anneal,
VirtualGraph vgraph)
Check GridFactory.moveVertex(). |
void |
Anneal_Test02.checkRestorePath(Anneal anneal,
VirtualGraph vgraph)
Check ErasedPath.restore() by removing and restoring arbitrary edges. |
private void |
Anneal_Test02.scrambleChain(VirtualChain chain,
VirtualGraph vgraph,
GridFactory factory)
Move chain vertices around to make sure it would be rerouted. |
private void |
VirtualGraph_Test01.checkVSpacing(int min,
int max,
VirtualGraph vgraph)
|
private void |
VirtualGraph_Test01.checkXESpacing(int spacing,
VirtualGraph vgraph)
|
private void |
VirtualGraph_Test01.checkEESpacing(int spacing,
int width,
VirtualGraph vgraph)
|
static int |
AnnealWithCell.dot(VirtualGraph g,
int maxiter)
|
int |
AnnealWithCell.reRoute(VirtualGraph g,
int maxiter)
|
private void |
AnnealWithCell.createMap(VirtualGraph graph)
Create the map from given VirtualGraph. |
static void |
Grid.configure(VirtualGraph graph)
|
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. |
private void |
VirtualVertex.initBounds(VirtualGraph parent)
Default bounds for interrank virtual vertex. |
(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. |
static int |
Untangle.dot(VirtualGraph g,
int maxiter)
|
int |
Untangle.reRoute(VirtualGraph g,
int maxiter)
|
static void |
Route.dot(VirtualGraph g)
|
void |
Route.route(VirtualGraph g)
|
private java.util.SortedSet |
Route.init(VirtualGraph g)
|
private void |
Route.adjustChain(VirtualGraph graph,
VirtualEdge chaintail,
DotSpline spline,
DotPath path)
Move virtual vertices to routed locations so that other routing can take advantage of the spare spaces. |
static int |
Position.dotPosition(VirtualGraph g)
|
static void |
Position.saveResult(VirtualGraph g)
|
static void |
Position.printPositionGraph(VirtualGraph g)
Print Position() result for viewing with ide.plugins.plotGraph. |
int |
Position.position(VirtualGraph g)
|
private void |
Position.expandGraph(VirtualGraph g)
Expand subgraph and clusters to vertices. |
private void |
Position.yPosition(VirtualGraph g)
Determine y coordinates for each vertex. |
private int |
Position.xPosition(VirtualGraph g)
Determine x coordinates of each vertex. |
private void |
Position.cleanupGraph(VirtualGraph g)
Remove auxillary vertices and edges added for x-ranking, ... |
private void |
Position.aspectRatio(VirtualGraph g)
Adjust for desired aspect ration. |
private DotGraph |
Position.initGraph(VirtualGraph g)
Create a DotGraph for x-position ranking. |
static int |
MinCross.dot(VirtualGraph g,
int startpass,
int endpass,
int seed)
|
private int |
MinCross.minCross(VirtualGraph g,
int startpass,
int endpass,
int seed)
Run minCross algorithm on given graph 'g'. |
private int |
MinCross.minCrossStep(VirtualGraph g,
int iter)
|
private boolean |
MinCross.medians(VirtualGraph g,
int r0,
int r1)
|
private boolean |
MinCross.reorder(VirtualGraph g,
int r,
boolean reverse,
boolean hasnoswap)
A special (bubble) sort function on the given rank that reorder vertices in ascending median value but preserve order of flat connected (keepOrder) vertices. |
void |
MinCross.transpose(VirtualGraph g,
boolean reverse)
|
private int |
MinCross.transposeStep(VirtualGraph g,
int r,
int step,
boolean reverse)
|
private void |
MinCross.permutate(VirtualGraph g,
int seed)
Cost of route distance approximated by absolute order distance of tails to 'v'. |
(package private) static void |
Cell.configure(VirtualGraph graph)
|
static int |
Anneal.dot(VirtualGraph g,
int griddiv,
int maxiter)
|
| Constructors in com.port80.graph.dot.impl with parameters of type VirtualGraph | |
GridFactory(VirtualGraph graph,
int griddiv)
|
|
ErasedPath(VirtualGraph graph)
|
|
VirtualVertex(com.port80.graph.IVertex v,
VirtualGraph parent)
Represent an IVertex. |
|
VirtualVertex(int rank,
java.lang.String label,
com.port80.graph.IEdge e,
VirtualGraph parent)
VirtualVertex represent an IEdge label. |
|
VirtualVertex(int rank,
com.port80.graph.IEdge e,
VirtualGraph parent)
VirtualVertex created between ends of an edge chain. |
|
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. |
|
Anneal(VirtualGraph g,
int griddiv)
|
|
|
|||||||||
| Home >> All >> com >> port80 >> graph >> dot >> [ impl overview ] | PREV NEXT | ||||||||