Uses of Class
prioritizer.Pairwise.Graph.Node

Packages that use Pairwise.Graph.Node
prioritizer   
 

Uses of Pairwise.Graph.Node in prioritizer
 

Fields in prioritizer declared as Pairwise.Graph.Node
private  Pairwise.Graph.Node[] Pairwise.Graph.nodes
           
private  Pairwise.Graph.Node Pairwise.Graph.Arc.from
           
private  Pairwise.Graph.Node Pairwise.Graph.Arc.to
           
 

Methods in prioritizer that return Pairwise.Graph.Node
 Pairwise.Graph.Node Pairwise.Graph.Arc.getFrom()
          Gets the node from where this arc leads
 Pairwise.Graph.Node Pairwise.Graph.Arc.getTo()
          Gets the node to where this arc leads
 

Methods in prioritizer with parameters of type Pairwise.Graph.Node
 double Pairwise.Graph.calculateRandomGeometricMean(Pairwise.Graph.Node from, Pairwise.Graph.Node to)
          Calculates and returns the geometric mean of a random sample of paths between the specified nodes
 double Pairwise.Graph.calculateGeometricMean(Pairwise.Graph.Node from, Pairwise.Graph.Node to)
          Calculates and returns the geometric mean of a all possible paths between the specified nodes
private  void Pairwise.Graph.recRandom(Pairwise.Graph.Node node, Requirement to, double value)
          Recursive algorithm used to calculate the pathproduct for a randomized path from a random outgoing arc from the start node.
private  void Pairwise.Graph.rec(Pairwise.Graph.Node node, Requirement to, double value)
          Recursive algorithm used to calculate the pathproduct for all possible paths from an outgoing arc from the start node.
 Pairwise.Graph.Arc Pairwise.Graph.Node.getArcTo(Pairwise.Graph.Node node)
          Gets the arc from this node to the specified node
 

Constructors in prioritizer with parameters of type Pairwise.Graph.Node
Pairwise.Graph.Arc(Pairwise.Graph.Node from, Pairwise.Graph.Node to, double value)
          Constructs an arc between the two specified nodes with the specified value