Uses of Class com.port80.graph.dot.impl.Grid

Overview

Package

Class

Use

Deprecated

Index

Home >> All >> com >> port80 >> graph >> dot >> [ impl overview ]

PREV NEXT

Uses of Class
com.port80.graph.dot.impl.Grid

Uses of Grid in com.port80.graph.dot.impl

Fields in com.port80.graph.dot.impl declared as Grid

(package private) Grid[] GridFactory.fPool


(package private) Grid GridFactory.fSpare


(package private) Grid[][] GridFactory.fGridTable
          Created grids in each rank.

(package private) Grid[] GridFactory.GridIterator.fGrids
          Created Grids in this rank.

private Grid[] GridHeap.heap


(package private) Grid Grid.parent

Methods in com.port80.graph.dot.impl that return Grid

Grid GridFactory.get()
          Get an uninitialized Grid from allocated pool.

Grid GridFactory.get(VirtualVertex v)
          Get an initialized vertex Grid.

(package private) Grid GridFactory.GridIterator.next()
          Get next Grid on the right of the given 'grid'.

Grid GridHeap.get(int i)


Grid GridHeap.peek()


Grid GridHeap.dequeue()
          In current implementation, dequeue() is not used.

static Grid Grid.newVertexGrid(VirtualVertex v)


static Grid Grid.newSpaceGrid(int rank, int x, float cost, float est)


private Grid Anneal.aStar(VirtualChain chain, ErasedPath erased, float oldcost)

Methods in com.port80.graph.dot.impl with parameters of type Grid

void GridFactory.unget(Grid a)
          Unfornately, since Grid object are put into the fGridTable once it is created, it would be expensive to unget the Grid object.

void GridHeap.enqueue(Grid a)


void GridHeap.requeue(Grid a)
          Reorder the given cell with value changed.

int Grid.accept(Grid parent, VirtualVertex dest, float cost)
          Check if visit from parent would result in a better path.

float Grid.travelCostFrom(Grid parent, Grid grandparent)


int Grid.lowerCostThan(Grid a)
          Find the item closer to the destination, ie.

(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 boolean Anneal.routePath(Grid end)
          Route path according to the newpath if cost improved, else restore old erased path.

private void Anneal.getPath(Grid end, boolean isdown, java.util.List ret)


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.

private java.lang.String Anneal.mapToGeneralPath(Grid[][] map)