Uses of Class
nz.ac.waikato.mcennis.rat.graph.path.PathNode

Packages that use PathNode
nz.ac.waikato.mcennis.rat.graph.algorithm   
nz.ac.waikato.mcennis.rat.graph.algorithm.prestige   
nz.ac.waikato.mcennis.rat.graph.algorithm.reusablecores   
nz.ac.waikato.mcennis.rat.graph.path   
 

Uses of PathNode in nz.ac.waikato.mcennis.rat.graph.algorithm
 

Fields in nz.ac.waikato.mcennis.rat.graph.algorithm declared as PathNode
protected  PathNode[] OptimizedPathBase.path
           
 

Methods in nz.ac.waikato.mcennis.rat.graph.algorithm with parameters of type PathNode
protected  void OptimizedPathBase.compare(PathNode current, PathNode next, Link link)
           
protected abstract  void OptimizedPathBase.doAnalysis(PathNode[] path, PathNode source)
           
protected abstract  void OptimizedPathBase.doAnalysis(PathNode[] path, PathNode source)
           
protected abstract  void OptimizedPathBase.doCleanup(PathNode[] path, Graph g)
          Any additional calculations to be performed before control returns to the scheduler
 

Uses of PathNode in nz.ac.waikato.mcennis.rat.graph.algorithm.prestige
 

Methods in nz.ac.waikato.mcennis.rat.graph.algorithm.prestige with parameters of type PathNode
protected  void OptimizedBetweeness.doAnalysis(PathNode[] path, PathNode source)
           
protected  void OptimizedBetweeness.doAnalysis(PathNode[] path, PathNode source)
           
protected  void OptimizedCloseness.doAnalysis(PathNode[] path, PathNode source)
           
protected  void OptimizedCloseness.doAnalysis(PathNode[] path, PathNode source)
           
protected  void OptimizedBetweeness.doCleanup(PathNode[] path, Graph g)
           
protected  void OptimizedCloseness.doCleanup(PathNode[] path, Graph g)
           
protected  void OptimizedLinkBetweeness.doCleanup(PathNode[] path, Graph g)
           
 

Uses of PathNode in nz.ac.waikato.mcennis.rat.graph.algorithm.reusablecores
 

Methods in nz.ac.waikato.mcennis.rat.graph.algorithm.reusablecores with parameters of type PathNode
protected  void PathBaseCore.compare(PathNode current, PathNode next, Link link)
           
protected  void ActorDistanceMatrixCore.doAnalysis(PathNode[] path, PathNode source)
           
protected  void ActorDistanceMatrixCore.doAnalysis(PathNode[] path, PathNode source)
           
protected  void OptimizedLinkBetweenessCore.doAnalysis(PathNode[] path, PathNode source)
           
protected  void OptimizedLinkBetweenessCore.doAnalysis(PathNode[] path, PathNode source)
           
protected abstract  void PathBaseCore.doAnalysis(PathNode[] path, PathNode source)
           
protected abstract  void PathBaseCore.doAnalysis(PathNode[] path, PathNode source)
           
protected  void ActorDistanceMatrixCore.doCleanup(PathNode[] path, Graph g)
           
protected  void OptimizedLinkBetweenessCore.doCleanup(PathNode[] path, Graph g)
           
protected abstract  void PathBaseCore.doCleanup(PathNode[] path, Graph g)
          Any additional calculations to be performed before control returns to the scheduler
 

Uses of PathNode in nz.ac.waikato.mcennis.rat.graph.path
 

Methods in nz.ac.waikato.mcennis.rat.graph.path that return PathNode
 PathNode PathNode.getPrevious()
          Return the previous PathNode in this implicit Path.
 

Methods in nz.ac.waikato.mcennis.rat.graph.path with parameters of type PathNode
 void PathNode.setPrevious(PathNode p)
          Set the previous PathNode in the spanning tree implicitly defined by this set of PathNodes.