edu.utdallas.paged.mem.algorithm
Class NodeStampDegreeCentrality

java.lang.Object
  extended by edu.utdallas.paged.mem.algorithm.CacheAlgorithmBase
      extended by edu.utdallas.paged.mem.algorithm.NodeStampDegreeCentrality
All Implemented Interfaces:
java.lang.Comparable<java.lang.Object>

public class NodeStampDegreeCentrality
extends CacheAlgorithmBase

A class that implements the degree centrality algorithm. Nodes with a higher degree centrality are left in memory whereas nodes with a lower degree centrality are written to disk

Author:
vaibhav

Field Summary
 
Fields inherited from class edu.utdallas.paged.mem.algorithm.CacheAlgorithmBase
connections, currTime, individualCC, transitiveCC
 
Constructor Summary
NodeStampDegreeCentrality()
           
 
Method Summary
 int compareTo(java.lang.Object o1)
          Method that implements the comparable interface for degree centrality.
 
Methods inherited from class edu.utdallas.paged.mem.algorithm.CacheAlgorithmBase
getConnections, getCurrentTime, getIndividualCC, getTransitiveCC, setConnections, setCurrentTime, setIndividualCC, setTransitiveCC
 
Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

NodeStampDegreeCentrality

public NodeStampDegreeCentrality()
Method Detail

compareTo

public int compareTo(java.lang.Object o1)
Method that implements the comparable interface for degree centrality.

Specified by:
compareTo in interface java.lang.Comparable<java.lang.Object>
Specified by:
compareTo in class CacheAlgorithmBase
Parameters:
o1 - - nodestamp object against which the current object is compared
Returns:
an integer that determines if the current node must come before the parameter node based on the degree centrality