net.walend.measured
Interface TieBreaker

All Known Implementing Classes:
CEPathsFromShortestDistancesTest.TestTieBreaker

public interface TieBreaker

TieBreakers break ties when finding paths within CEPathsFromShortestDistances and GEPathsFromShortestDistances.

Author:
David Walend dfw1@cornell.edu

Method Summary
 int breakTie(java.lang.Object node1, int index1, java.lang.Object node2, int index2, java.lang.Object toNode)
          Determine which node should be the winner.
 void clear()
          Clear any caches of values.
 

Method Detail

breakTie

public int breakTie(java.lang.Object node1,
                    int index1,
                    java.lang.Object node2,
                    int index2,
                    java.lang.Object toNode)
Determine which node should be the winner.

Returns:
index1 if node1 is better, index2 if node2 is better.

clear

public void clear()
Clear any caches of values. Called at the beginning of any series of breakTie calls for the same step in the path.



Copyright (c) 2001, 2002, David Walend