graph
Class Score

java.lang.Object
  |
  +--graph.Score

public class Score
extends java.lang.Object

We say that an operation is forced, when that operation is the only operation possible (say at that given vertex). We say that an operation is neglectable, if carrying out that operation necessarily leads to a graph over the squanderTarget. Thus, an operation is forced, if all other operations are neglectable.

In terms of methods. boolean Neglectable.... true is decisive, false means the test was inconclusive. boolean Forced.... true is decisive, false test was inconclusive.

All methods are final static, and objects cannot be created.

class Constants : constants but no methods. class Parameter : use constants for things that don't require a graph. class Score : use constants for things that require a graph.


Inner Class Summary
static class Score.Test
           
 
Method Summary
static long hashVertex(Vertex V)
          helper for neglectableByBasePointSymmetry.
static boolean neglectable(Graph G, Parameter param)
           
static int scoreUpperBound(Graph G, Parameter p)
          An upper bound on the score of the Graph.
static int squanderLowerBound(Graph G, Parameter p)
          includes both faceSquanderLowerBound and excesses.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Method Detail

squanderLowerBound

public static final int squanderLowerBound(Graph G,
                                           Parameter p)
includes both faceSquanderLowerBound and excesses. Works fine whether all faces are isFinal or not.

scoreUpperBound

public static final int scoreUpperBound(Graph G,
                                        Parameter p)
An upper bound on the score of the Graph.
Parameters:
p - scoring parameter. precondition: all faces have isFinal attribute true.

neglectable

public static boolean neglectable(Graph G,
                                  Parameter param)

hashVertex

public static long hashVertex(Vertex V)
helper for neglectableByBasePointSymmetry. hash = sum_i^size base^(facesize#i) base is large enough that that largest hash vertex will appear on a largest face