src/main/java/edu/ufl/cise/colamd/tdouble/Colamd_Col.java

   1 package edu.ufl.cise.colamd.tdouble;
   2
   3 public class Colamd_Col {
   4
   5         /* index for A of first row in this column, or DEAD */
   6         /* if column is dead */
   7         public int start ;
   8
   9         /* number of rows in this column */
  10         public int length ;
  11
  12         private int shared1 ;
  13         private int shared2 ;
  14         private int shared3 ;
  15         private int shared4 ;
  16
  17         public Colamd_Col () {
  18
  19         }
  20
  21         /* number of original columns represented by this */
  22         /* col, if the column is alive */
  23         public int thickness () {
  24                 return shared1 ;
  25         }
  26         public void thickness (int thickness) {
  27                 shared1 = thickness ;
  28         }
  29
  30         /* parent in parent tree super-column structure, if */
  31         /* the column is dead */
  32         public int parent () {
  33                 return shared1 ;
  34         }
  35
  36         public void parent (int parent) {
  37                 shared1 = parent ;
  38         }
  39
  40
  41         /* the score used to maintain heap, if col is alive */
  42         public int score () {
  43                 return shared2 ;
  44         }
  45
  46         public void score (int score) {
  47                 shared2 = score ;
  48         }
  49
  50         /* pivot ordering of this column, if col is dead */
  51         public int order () {
  52                 return shared2 ;
  53         }
  54
  55         public void order (int order) {
  56                 shared2 = order ;
  57         }
  58
  59
  60         /* head of a hash bucket, if col is at the head of */
  61         /* a degree list */
  62         public int headhash () {
  63                 return shared3 ;
  64         }
  65
  66         public void headhash (int headhash) {
  67                 shared3 = headhash ;
  68         }
  69
  70         /* hash value, if col is not in a degree list */
  71         public int hash () {
  72                 return shared3 ;
  73         }
  74
  75         public void hash (int hash) {
  76                 shared3 = hash ;
  77         }
  78
  79         /* previous column in degree list, if col is in a */
  80         /* degree list (but not at the head of a degree list) */
  81         public int prev () {
  82                 return shared3 ;
  83         }
  84
  85         public void prev (int prev) {
  86                 shared3 = prev ;
  87         }
  88
  89
  90         /* next column, if col is in a degree list */
  91         public int degree_next () {
  92                 return shared4 ;
  93         }
  94
  95         public void degree_next (int degree_next) {
  96                 shared4 = degree_next ;
  97         }
  98
  99         /* next column, if col is in a hash list */
 100         public int hash_next () {
 101                 return shared4 ;
 102         }
 103
 104         public void hash_next (int hash_next) {
 105                 shared4 = hash_next ;
 106         }
 107
 108 }