graph
Class NodeInfo

java.lang.Object
  graph.NodeInfo

All Implemented Interfaces:

java.lang.Comparable

public class NodeInfo

extends java.lang.Object

implements java.lang.Comparable

Is used for sorting nodes with respect to topological invariants

Field Summary

(package private) static boolean	debug
(package private) int	id Node id; Graph.node[id] is the appropriate entry in the graph
(package private) java.lang.String	key Sorting key; is made from composing all topological invariants that we have tried so far

Constructor Summary

(package private)

NodeInfo(int i)

Method Summary

(package private) static boolean	allKeysDifferent(NodeInfo[] w) Do all elements in the sorted array have the same comparison key?
int	compareTo(java.lang.Object o) Used to sort entries by key
(package private) static int	hashArray(java.lang.Integer[] r) Converts an array of integers into a single "fingerprint" integer, using a hash function

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

debug

static boolean debug

id

int id

Node id; Graph.node[id] is the appropriate entry in the graph

key

java.lang.String key

Sorting key; is made from composing all topological invariants that we have tried so far

Constructor Detail

NodeInfo

NodeInfo(int i)

Method Detail

compareTo

public int compareTo(java.lang.Object o)

Used to sort entries by key

Specified by:

compareTo in interface java.lang.Comparable

allKeysDifferent

static boolean allKeysDifferent(NodeInfo[] w)

Do all elements in the sorted array have the same comparison key?

hashArray

static int hashArray(java.lang.Integer[] r)

Converts an array of integers into a single "fingerprint" integer, using a hash function