Docjar: A Java Source and Docuemnt Enginecom.*    java.*    javax.*    org.*    all    new    plug-in

Quick Search    Search Deep

com.port80.graph.dot.impl
Class ErasedPath  view ErasedPath download ErasedPath.java

java.lang.Object
  extended bycom.port80.graph.dot.impl.ErasedPath

public class ErasedPath
extends java.lang.Object

Data structure to hold information about the erased path.


Field Summary
(package private)  int bottomRank
           
private static boolean CHECK
           
private static boolean DEBUG
           
(package private)  VirtualVertex dest
           
(package private)  VirtualEdge[] edges
          Erased VirtualEdges indexed by rank.
private  int fCELL_BASICFACTOR
           
private  int fCELL_DISTFACTOR
           
private  int fCELL_TURNFACTOR
           
private  int fCELL_XDIV
           
(package private)  VirtualChain fChain
           
private  float fFAST_DISTCOST
           
(package private)  VirtualGraph fGraph
           
(package private)  int fMaxRank
           
(package private)  int fMinRank
           
(package private)  VirtualGraph.Rank[] fRanks
           
(package private)  boolean isDown
           
private  int MAXSLACK
          Max path cost slack allowed for route to be considered done.
private static java.lang.String NAME
           
(package private)  float oldCost
           
(package private)  VirtualVertex src
           
(package private)  int topRank
           
private static boolean VERBOSE
           
(package private)  java.util.List vertices
          Erased VirtualVertex including the source and destination in chain vertex order.
 
Constructor Summary
(package private) ErasedPath(VirtualGraph graph)
           
 
Method Summary
(package private)  void clear()
           
(package private)  VirtualEdge edge(int r)
           
(package private)  float erase(VirtualChain chain, boolean isdown)
          Erase route for given edge chain to prepare for reroute.
(package private)  float fastCost()
          Cost limit for fast run.
(package private)  VirtualVertex get(int i)
           
(package private)  boolean isBusRoute()
           
(package private)  boolean isDown()
           
(package private)  void restore()
           
(package private)  int size()
           
 java.lang.String toString()
          Convert this Object to a human-readable String.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
 

Field Detail

NAME

private static final java.lang.String NAME
See Also:
Constant Field Values

DEBUG

private static final boolean DEBUG
See Also:
Constant Field Values

CHECK

private static final boolean CHECK
See Also:
Constant Field Values

VERBOSE

private static boolean VERBOSE

MAXSLACK

private final int MAXSLACK
Max path cost slack allowed for route to be considered done.

See Also:
Constant Field Values

fGraph

VirtualGraph fGraph

fRanks

VirtualGraph.Rank[] fRanks

fMinRank

int fMinRank

fMaxRank

int fMaxRank

fChain

VirtualChain fChain

vertices

java.util.List vertices
Erased VirtualVertex including the source and destination in chain vertex order. The src vertex not erased is replaced by null. Destination vertex is always erased.


edges

VirtualEdge[] edges
Erased VirtualEdges indexed by rank.


src

VirtualVertex src

dest

VirtualVertex dest

topRank

int topRank

bottomRank

int bottomRank

isDown

boolean isDown

oldCost

float oldCost

fCELL_XDIV

private int fCELL_XDIV

fCELL_BASICFACTOR

private int fCELL_BASICFACTOR

fCELL_TURNFACTOR

private int fCELL_TURNFACTOR

fCELL_DISTFACTOR

private int fCELL_DISTFACTOR

fFAST_DISTCOST

private float fFAST_DISTCOST
Constructor Detail

ErasedPath

ErasedPath(VirtualGraph graph)
Method Detail

size

int size()

edge

VirtualEdge edge(int r)

get

VirtualVertex get(int i)

clear

void clear()

isBusRoute

boolean isBusRoute()

isDown

boolean isDown()

fastCost

float fastCost()
Cost limit for fast run. A minimal cost limit forbide AStar to search too far.


erase

float erase(VirtualChain chain,
            boolean isdown)
Erase route for given edge chain to prepare for reroute. All cells on the route are marked as SPACE except the src cell. . Update cross cost in all ranks affected. . Mark vertices on the path as SPACE. Note that removing an edge currently have no cross cost still affect cross cost of imaginary edges which have counted this edge.


restore

void restore()

toString

public java.lang.String toString()
Description copied from class: java.lang.Object
Convert this Object to a human-readable String. There are no limits placed on how long this String should be or what it should contain. We suggest you make it as intuitive as possible to be able to place it into System.out.println() 55 and such.

It is typical, but not required, to ensure that this method never completes abruptly with a java.lang.RuntimeException.

This method will be called when performing string concatenation with this object. If the result is null, string concatenation will instead use "null".

The default implementation returns getClass().getName() + "@" + Integer.toHexString(hashCode()).